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:
1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']

Ex Output:
0


Ex Input:
2, 2, ['E', 'i']

Ex Output:
0


Ex Input:
4, 16, ['H', 'e', 'E', '2497', '5899', '109', 'j', 'Z', 'J', '1537', 'E', 'F', '9071', '2455', '2937', 'm', '3555', 'S', '5545', 'y', 'z', 'u', 'M', '7521', 'j', 'U', 'h', 'u', 'v']

Ex Output:

24505