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:
2, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']

Ex Output:
30904


Ex Input:
1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']

Ex Output:
0


Ex Input:
3, 4, ['8761', '6115', 'x', '9003']

Ex Output:

9003