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: 6, 7, ['6997', '3987', '2463', 'm', 'W', 'R', 'a', 'U', 's', 'Y', 'X', '4193', '343', 'Y', '4277', 'n', 'W']
Example Output: 0

Example Input: 1, 2, ['t', '9343', 'g']
Example Output: 9343

Example Input: 3, 5, ['T', '8259', 'q', 'O', 'g', '3543', 'H', '6961', 'S', 'Z', 'S', 'o']
Example Output:
0