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:
1, 2, ['1811', 'K', '3343', 'e']

Ex Output:
1811


Ex Input:
5, 16, ['a', '2439', 'p', '6759', 'z', '2233', 'q', '1447', 'Y', 'k', 'Y', 'Y', '4489', 'N', '5251', '5367']

Ex Output:
18787


Ex Input:
2, 8, ['h', 'h', '6067', 't', '6489', '1375', 'L', '8197', 'l']

Ex Output:

22128