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:
8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

Ex Output:
3932


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

Ex Output:
3396


Ex Input:
4, 7, ['8579', '4873', 'u', 'B', 'S', '6457', '1235']

Ex Output:

7692