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, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']

Ex Output:
7459


Ex Input:
2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']

Ex Output:
27506


Ex Input:
5, 6, ['o', '7703', '5091', '2363', 'h', 'b', '5349', 'h']

Ex Output:

0