In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

[Q]: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']
[A]: 42698


[Q]: 2, 2, ['4965', '6219']
[A]: 6219


[Q]: 4, 18, ['J', 'n', 'b', 'y', 'y', '575', '5655', 'L', 'P', 'x', '4617', 'h', '4529', '6201', 'S', '4257', 'H', 'p', '9295']
[A]:
25834