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: 5, 22, ['t', '8483', '8799', 'W', 'l', '2567', '2787', 'L', 'G', 'T', '5765', '5029', '8059', '8505', '6905', 'Z', '8153', 'e', 'K', '3529', 'g', '2667', '6629', 'O']
Example Output: 53966

Example Input: 4, 6, ['g', '8871', 'q', '597', '8871', '277', 'f', 'e', '2779']
Example Output: 9745

Example Input: 6, 8, ['R', 'K', 'N', '8333', 'w', '1145', 'o', 'E', 'e']
Example Output:
1145