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:
3, 4, ['u', '5041', 'E', 'U', 'a', 'd']

Ex Output:
0


Ex Input:
1, 2, ['1907', '1489', 'm', '4571', 'a']

Ex Output:
3396


Ex Input:
2, 11, ['9469', 'R', 'v', 'm', '1907', 'w', 't', 'W', '8605', 't', 'F', '1873', 'i', '151']

Ex Output:

10512