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:
16, 20, ['7527', '5121', 'Q', '4585', '9735', 'Y', 'e', 'p', '755', '8605', 'B', 'O', 'X', '3887', 'M', '8347', '2391', 'v', 'F', '5509', 'e', 'g', 'm', 'j', 'P', 'J']

Ex Output:
16247


Ex Input:
4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']

Ex Output:
0


Ex Input:
2, 13, ['n', 'b', 'S', '8183', '3577', '1913', 'O', '4847', '5241', 'Q', '5733', '8035', '2731', 'n', '8563', 'e', 'p', 'W', 'W', 'Y', 'q', '4559', 'p', '5145', 'L', '5327', 'y', '4861', '8031', '2693']

Ex Output:

40260