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, 3, ['h', 'w', '3397']

A: 3397
****
Q: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']

A: 19229
****
Q: 3, 20, ['9157', '359', '5793', '3947', '9245', 'i', '43', '3475', '6559', 't', '353', '4699', '241', '337', 'k', '3893', '8425', 'v', 'N', 'M']

A:
47010
****