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, 4, ['1809', '1127', 'm', '3137']

Ex Output:
3137


Ex Input:
3, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']

Ex Output:
62091


Ex Input:
6, 9, ['O', 'o', 'q', '7795', '169', '837', 'V', '6211', '5567', 's', 'E']

Ex Output:

12615