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:
5, 22, ['t', '8483', '8799', 'W', 'l', '2567', '2787', 'L', 'G', 'T', '5765', '5029', '8059', '8505', '6905', 'Z', '8153', 'e', 'K', '3529', 'g', '2667', '6629', 'O']

Ex Output:
53966


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

Ex Output:
3396


Ex Input:
3, 8, ['4989', '6093', '9453', '1597', 'R', 'l', '7049', '101', 'Y', '5691', 'T', 'f']

Ex Output:

18200