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: 21, 24, ['6903', '3349', '4585', 'C', 'w', 'I', 'U', 'n', '2689', 'W', '6601', '7357', '5063', 'y', '5779', 'L', '4257', 'd', '653', 'k', '8349', 'r', 'Y', '3019', 'E', '797', 'm']

A: 11368
****
Q: 6, 11, ['4199', 't', 'Z', '1801', 'y', 'W', 'b', '5165', 'c', '517', 'k', '8369']

A:
5682
****