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.

Input: Consider Input: 3, 21, ['X', 'Z', '749', '5557', '9991', 'T', '3461', '335', 'I', 'J', '7113', 'b', '2683', '653', '3951', '4193', 'J', '7179', 'G', 'Y', '6151', '2873', 'X', '5619', '5151', '7689', '5605', 'o']

Output: 52016


Input: Consider Input: 2, 2, ['9797', '5585', '1849', '4485', '9225']

Output: 5585


Input: Consider Input: 3, 17, ['5063', '3725', '4867', 'D', '7093', '6709', 'O', 'w', 'l', 'b', '2581', '2135', '1171', 'U', 'E', '7775', 'z', '4645']


Output: 32331