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

Answer: 46930


Question: 5, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']

Answer: 0


Question: 2, 2, ['7347', 'M', 'J']

Answer:
0