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:
4, 5, ['677', '5585', 'W', 'J', 'C']

Ex Output:
0


Ex Input:
1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']

Ex Output:
25374


Ex Input:
21, 23, ['A', '8569', '5101', '5903', '1683', '7321', 'o', 'd', '6421', 'W', '6815', '5669', '1973', 'c', 'd', 'i', 'M', '4921', '3995', 'H', 'N', 'T', '9655', '1103', 'Q', '6097', 'l', 'x']

Ex Output:

9655