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:
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, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']

Ex Output:
19785


Ex Input:
3, 18, ['G', '2279', '4863', '9237', 'P', '4841', 'A', 'v', '8065', '1571', 'R', '827', '3517', '745', '7197', '9759', '4275', '3625', 'p', '1075', '4981', 'G', '4793', '665']

Ex Output:

58522