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:
2, 2, ['9797', '5585', '1849', '4485', '9225']

Ex Output:
5585


Ex Input:
1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']

Ex Output:
0


Ex Input:
4, 5, ['2013', 'K', '4359', '8407', '25', '859', '7917', 'A']

Ex Output:

8432