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: 1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']

A: 25374
****
Q: 1, 3, ['H', 'R', '109', '1379']

A:
109
****