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, 7, ['6261', 'l', 'T', 't', 'X', 'G', 'Y', 'f']

Ex Output:
0


Ex Input:
6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']

Ex Output:
6313


Ex Input:
9, 11, ['3923', '2719', '729', 'M', 'B', 'n', 'o', 'w', 'Q', '4169', '4495', '3797', 'K', '5031', 'v']

Ex Output:

8664