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, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']

Ex Output:
0


Ex Input:
4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

Ex Output:
15701


Ex Input:
15, 17, ['F', '3839', 'I', '6699', 'l', 'x', '3269', '7267', 'v', 'J', '8703', '3849', '6121', 'f', 'H', 't', '8863', '6187', '819', '6533', '821', 'i', '9655', 'f']

Ex Output:

8863