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:
3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']

Ex Output:
40356


Ex Input:
1, 2, ['E', 'z']

Ex Output:
0


Ex Input:
9, 13, ['7443', 'V', 'l', 'L', '937', 'F', '687', '7633', '2117', 'X', '3857', '3917', '8845', 'W', '3439', 'F', 'c', '6625']

Ex Output:

18736