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: 4, 6, ['4301', 'a', 'E', '3709', '5105', 'B']

A: 8814
****
Q: 5, 15, ['r', '6933', '8849', '3479', 'H', '4269', '7469', '9359', 'K', '3371', 'A', '5371', 'z', 'K', '6147', 'i', 'Q', '9055', 'b', 'g', 'x', '5357', 'L', '2797', '7683', 'L', '7127', 'M']

A: 35986
****
Q: 6, 21, ['o', 'k', 'W', 'U', '4663', 'H', '525', '3995', 'r', '9863', '3363', 'e', 'H', '4459', 'K', '2245', 'E', '5247', '4005', '6897', '653', 'x', '3439', '4343', '9589', 'h']

A:
41252
****