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: 1, 3, ['Z', 'X', 't']

Output: 0


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: 9, 17, ['6525', 'I', '8387', '6389', 'B', 'X', '5735', '1927', 'H', '9795', 'x', '5299', '2921', 'b', '6377', 'V', 'z', 's', '1473', 'w', '5507', 'o', 'S']


Output: 24392