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:
1, 1, ['D', 'W', '5783']

Ex Output:
0


Ex Input:
11, 15, ['W', '8193', '2581', 'f', 'j', '5727', 'A', '6177', 'u', '4201', 'T', 'w', 'C', 'u', '7973', 'd', 'c']

Ex Output:
7973


Ex Input:
2, 9, ['A', '3491', '2039', '8865', '4235', '51', '3201', '4227', '6301', '5373', '9095', '3821', 'O', '79']

Ex Output:

32410