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, 6, ['2495', '83', '1257', '9157', 'z', 'Y', '8689', '385', '747', '1175', 'j', 'U', 'k']

Ex Output:
10497


Ex Input:
1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Ex Output:
0


Ex Input:
1, 5, ['t', '6001', 's', 'v', '7029']

Ex Output:

13030