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: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']

A: 22725
****
Q: 10, 11, ['5261', 'F', 'J', 'N', '7603', 'j', 'M', 'W', '5591', '8351', 'f', 'V', '4989', '3201']

A:
8351
****