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:
4, 25, ['H', '501', 'F', '4923', 'C', 'T', 'R', 'b', 'Z', 'e', 'i', 'H', '755', '6503', '2825', 'H', '1995', '7283', '2735', '4433', 's', 'P', '795', 'Z', 'Z']

Ex Output:
32247


Ex Input:
5, 8, ['j', '1099', 'J', 'l', 'E', '6559', '6181', '4441']

Ex Output:
17181


Ex Input:
2, 6, ['1499', 'A', 'm', '1723', '1327', 'm', 'P', '3917', 'S']

Ex Output:

3050