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:
6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']

Ex Output:
17360


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

Ex Output:
0


Ex Input:
1, 9, ['855', '7425', 'w', '6563', '1167', 'F', '2597', '5391', 'o', 'b', '8419']

Ex Output:

23998