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, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']

Ex Output:
32351


Ex Input:
9, 13, ['6195', 'k', '6835', 'u', '4049', '3063', 'N', 'q', 'R', 'Y', '8573', 'r', '2037', 'w', 'D', 'Y', '9849', 'T', '2245', '6999']

Ex Output:
10610


Ex Input:
1, 1, ['5783', 'p', 'u']

Ex Output:

5783