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, 6, ['d', 'v', 'd', '5043', '8989', 'w', 'Y']

A: 14032
****
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: 3, 6, ['w', 'V', '7413', '5027', 's', '7037', 'S', '763', 'D', 'U', 'x', 'l', '9331', 'S', 'k', '8369', 'D', 'A', 'e', 'A', 'r', '5113', '1367', '4197', 'm']

A:
19477
****