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, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']

Ex Output:
0


Ex Input:
6, 7, ['6947', 'l', 'd', '6531', 'X', 'l', '9741', '6553', '9905', 'n', 'Q', 'Y', '2063']

Ex Output:
9741


Ex Input:
10, 12, ['2439', '6779', '1091', 'Q', '3601', 'l', 'l', 'E', '2723', 'k', 'l', '2585', 'S', '9075', '6261', '5445', 'y', 'f']

Ex Output:

2585