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, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']

Ex Output:
19229


Ex Input:
1, 6, ['237', 'x', 'Q', 'J', '4629', 'q', '2831', 'i', 'm']

Ex Output:
4866


Ex Input:
2, 2, ['u', '1827', 'Y', '2471', '551', 'C', '5165', '4115']

Ex Output:

1827