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, 14, ['8305', 'q', '9455', '9395', '8619', '8071', '5379', '1109', '2481', '461', '6235', '2597', 'r', '8289', 'J']

Ex Output:
62091


Ex Input:
8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']

Ex Output:
203


Ex Input:
14, 21, ['2315', '1941', '6229', '7535', 'F', 'U', '6729', '8353', 'f', 'h', '3697', 'm', 'A', 'd', '7901', '1615', 'l', '2875', 'C', 'l', '6743', '5535']

Ex Output:

19134