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:
1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']

Ex Output:
25374


Ex Input:
2, 7, ['E', 'e', '5585', 'g', '4971', '8891', '811', 'l', '527', '4299', 'b', 'N', '5079', 'j', '5555', '4789']

Ex Output:
20258


Ex Input:
1, 1, ['2391', '1401']

Ex Output:

2391