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.

Example 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']
Example Output: 52016

Example Input: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']
Example Output: 1351

Example Input: 2, 2, ['6569', 'L', 'B', '891', 'K', '9763', '5875', 'E', 'D', 'k', '3339', '5235']
Example Output:
0