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, 2, ['M', 'I', 'G', '3747']

Ex Output:
0


Ex Input:
12, 14, ['6255', 'M', '3541', 'A', 'I', 'W', '2289', '9861', 'L', '2527', 'h', '355', '7033', 'p', 'f']

Ex Output:
7388


Ex Input:
1, 9, ['5065', 'z', '6207', 'v', '311', '2723', '1571', 'U', 'P']

Ex Output:

15877