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:
5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']

Ex Output:
7356


Ex Input:
4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Ex Output:
439


Ex Input:
3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']

Ex Output:

40356