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.

Ex Input:
1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']

Ex Output:
30959


Ex Input:
14, 29, ['1447', 'P', 'X', '5411', '4235', 'K', '6749', '171', '9349', 'K', 'n', '3477', '1183', '9933', '6259', '5793', '1719', 'V', 'C', '1983', '9947', 'I', 'c', '4425', 'Q', 'v', 'a', '3783', '9665', 'z']

Ex Output:
53507


Ex Input:
1, 8, ['M', 'm', 'R', '7639', 'Z', '6281', '1091', 'v', '2243', '5125', 'R', 'K', '235', '9707', 'U', '3455']

Ex Output:

15011