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:
4, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']

Ex Output:
20400


Ex Input:
6, 6, ['j', '7089', '2423', 'Z', '7537', 'w', 'A', '1121', '6047', '6727', '5891', 'Y', 'X', 'n', '2581', '4629', '9939', 'K', '6655', '293', 'D']

Ex Output:

0