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: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']

A: 19229
****
Q: 7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']

A: 9511
****
Q: 8, 10, ['9943', '4449', 'U', 'S', 'E', '3293', '6943', '9153', '7601', 'g', 's', 'O', 'D', '839', '6373', '6419', 'S', '9863', 'p', '2599', '6049', '4727', '8291', '2111', 'x', '1171', '8317']

A:
16754
****