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: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

A: 29965
****
Q: 5, 22, ['r', '8607', '6681', 'f', 'p', 'e', '907', 'S', 'd', '2549', 'S', '9065', 't', '3623', 'o', 'v', '9963', '7321', '6459', '5023', 'e', 'd', 'k', '4017', 'I', 'f', 'Z']

A:
44910
****