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:
6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']

Ex Output:
21079


Ex Input:
3, 7, ['1811', 'Z', 'C', 'x', '6171', 'W', 'N', 'L', 'h', '4497']

Ex Output:
6171


Ex Input:
1, 1, ['6415', '5571']

Ex Output:

6415