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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

A: 1351
****
Q: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']

A: 22725
****
Q: 7, 15, ['6571', 'J', 'N', '3371', 'p', 's', '5677', '6783', '1697', 'u', 'c', 'F', 'D', '9867', 'Y']

A:
24024
****