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, 1, ['f', '6023', 'A', 'f', '4665', 'u', 'o', '7783', 'a', 'N', 'd', '7685', 'W', '9631', 'e', 'W', '1625', 'Q', 'B', '9097', '7613', 'L', '9929', '8469']

Ex Output:
0


Ex Input:
2, 4, ['X', 'o', '8807', 'r', 'q', '825']

Ex Output:
8807


Ex Input:
15, 20, ['1121', 'o', '1057', 'B', '2357', 'b', 'i', '6903', 'r', '5591', 'O', '3739', 'O', 'b', 'O', '459', 't', '7925', '5681', '8377', '7967', 'Y', '1261']

Ex Output:

22442