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, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Ex Output:
0


Ex Input:
2, 3, ['o', 'p', '4765', 'u', '629', 'p']

Ex Output:
4765


Ex Input:
15, 15, ['w', '6693', 'y', 'Q', 't', 'B', '343', '9977', 'b', '3647', '7247', '201', '1205', 'p', 'V', '6611', 'd', '3033', '4859']

Ex Output:

0