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.

Input: Consider Input: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']

Output: 6933


Input: Consider Input: 11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']

Output: 7973


Input: Consider Input: 14, 14, ['o', 'l', '7743', '5341', 'w', 'x', 'o', 'x', '3583', '1343', '4639', '1633', 'A', 'Y', 'm', 'd', 'H', '5925', 'E', 'u', 'l', 'n']


Output: 0