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: 1, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']

A: 32007
****
Q: 6, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

A: 0
****
Q: 1, 8, ['4439', '6553', '5001', 'I', '8281', 'C', '8943', '6571', '5459', 'S', 'p', 'K']

A:
39788
****