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, 15, ['9611', 'm', '8001', '7451', 'O', '753', 'F', 'F', '3017', '8265', 'j', '5753', 'B', 'Q', '4079', 'k', 'N', '5197', '3885', '3193']

A: 46930
****
Q: 3, 4, ['2425', 'J', 'x', '8829', 't', '7927', 'R', 'J', '1599', '3149']

A: 8829
****
Q: 6, 20, ['e', 'C', '173', '4565', 'D', '1221', 'w', 'O', '5529', '5763', 'v', 'R', '4195', 'O', '2979', '4643', 'w', 'H', '9727', '2623', '4887', '9789', 'Z']

A:
36680
****