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:
7, 18, ['o', '3007', '4747', '869', 'H', '7455', 'U', 'G', '6009', 'H', 'p', '381', '5217', 'q', '1251', 'G', 'i', 'X', '7649', '415', '8053', 'o']

Ex Output:
12858


Ex Input:
5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']

Ex Output:
29965


Ex Input:
3, 9, ['3029', '3133', '6677', '703', 'N', '5697', 'r', '1299', 'x', '1605', 'F', 'B', 'S']

Ex Output:

14376