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:
6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']

Ex Output:
0


Ex Input:
1, 4, ['3757', 'z', '9029', '6903', '7185']

Ex Output:
19689


Ex Input:
5, 16, ['1837', '827', 'D', 'W', 'A', '3643', 'o', '1205', '5047', '5343', 'K', '3235', '1833', '5345', '1433', 's']

Ex Output:

27084