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, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Output: 0


Input: Consider Input: 5, 8, ['5745', '5919', '2351', 'M', '3273', '6855', '2999', 's', 'F', 'o', 'W', '8607']

Output: 13127


Input: Consider Input: 3, 8, ['9605', '9091', '8427', '3413', 'C', '9665', '7695', 'U', '1727', 'A', 'C', 'c', '401', 'Q', 'B', '4691', 'e', 'H', '4193', '4123', '5163', '1425', '2237']


Output: 29200