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, 7, ['E', 'e', '5585', 'g', '4971', '8891', '811', 'l', '527', '4299', 'b', 'N', '5079', 'j', '5555', '4789']

A: 20258
****
Q: 9, 9, ['y', '689', 'X', 'X', 'u', '1839', '8779', 'O', 'O', 'A', '1559', 'A', 'U']

A: 0
****
Q: 15, 22, ['S', '9985', 'a', 'X', 'C', 'k', '5193', 'B', 'X', '3661', 'B', '1711', '1499', 'E', 'h', '7171', '151', 'Z', '6109', '4863', '7145', 'H', 'G']

A:
25439
****