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, 2, ['8895', 't', '5739']

A: 8895
****
Q: 1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']

A: 26847
****
Q: 6, 22, ['J', 'f', '2691', 'f', '5081', '9913', '1477', '6797', '6241', 'A', 'c', '4269', 'n', '8269', 'S', 'h', 'e', 'p', 'F', 's', '1927', 'T']

A:
38893
****