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: 2, 7, ['1505', 'V', '4287', 'M', 'i', 'J', '9343', 'X', '2691', 'W', 'u', '7711', 'X', 'y', '9189']
Example Output: 13630

Example Input: 17, 21, ['7037', '9447', 'f', 'R', '1237', '5735', '1327', '1371', 'd', '3025', 'B', '9165', '3447', '6135', '3315', 'l', '8069', 'g', 'H', 'e', '4523', '3149', 'H', 'o', '3947']
Example Output: 12592

Example Input: 4, 21, ['M', '809', 'A', '6617', 'L', 'w', 'A', '8121', '4325', '7259', 'P', '5867', '5721', 'p', '5015', 'G', 'Z', 't', 'w', '6469', '2721', '5469', 'D', 'I']
Example Output:
52115