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, ['m', 'E']

A: 0
****
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: 2, 25, ['655', '1719', 'e', 'm', 'W', 's', '2713', 'o', 'Q', '457', '7677', 't', '6249', '1911', 'H', 'd', '8653', 'N', 'a', 'G', '3987', '2049', 'N', '5105', 'b']

A:
40520
****