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:
5, 6, ['i', 'i', 'J', 'O', '4571', 'o', '2073', '87', 'x', '9937', '9917', '4283', 'S']

Ex Output:
4571


Ex Input:
4, 5, ['t', '9215', 'K', 'Q', 'w']

Ex Output:
0


Ex Input:
2, 8, ['G', '6345', '9777', 'y', 'R', 'm', 'N', '8219', 'K', 'P', '3691', 'Q', '8167', '2383', 'j', 'L', 'j', '3231', '765', '4229', 'A', 'c', '3811', '4331', 'd', '5381']

Ex Output:

24341