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:
3, 5, ['i', 'e', '6583', '313', '5511']

Ex Output:
12407


Ex Input:
3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']

Ex Output:
0


Ex Input:
3, 4, ['2039', '1693', 'i', '6699', '6413', '8435', 'k', '7887', '4959', '2989', '639', '6105', '7899', '775', '1859', 'e', 'A', 'V', 'W', 'i', 'x', '3997', 'f', 'f', 'X', '1415', 'x', '8547', 'b']

Ex Output:

6699