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:
4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Ex Output:
10432


Ex Input:
5, 10, ['8997', '5907', '6269', 'u', '2349', 'e', 'D', 'i', '9243', '2217', '3987', 'V', 'q', 'X', 'b', '3571', 'S', 'U', 'e', 'F']

Ex Output:

13809