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, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']

Ex Output:
2957


Ex Input:
3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']

Ex Output:
0


Ex Input:
2, 9, ['S', 'k', 't', 'z', '6875', '283', '881', '3401', '1911', '7269', 'Q', 'i', '623', 's']

Ex Output:

13351