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: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']
Example Output: 4918

Example Input: 2, 3, ['o', 'p', '4765', 'u', '629', 'p']
Example Output: 4765

Example Input: 17, 26, ['3851', '4363', 'r', '3831', '4503', 'u', 'w', '4023', 'q', 'B', '1039', 'T', 'l', '4523', '5481', '6783', '4321', '3937', 'N', 'W', 'Z', 'L', '3397', '6683', 'z', 'w']
Example Output:
18338