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, ['a', 'q', 'a', '4295', 'z', '675', '3975', 'P', 'e', '4231', '2547', 'V', 'S', '5285', 'Y', 'J']

Ex Output:
4295


Ex Input:
1, 2, ['1811', 'K', '3343', 'e']

Ex Output:
1811


Ex Input:
1, 4, ['3211', 'P', '4611', '767', '807', '2045', '4351', '1639', 'b', '6617']

Ex Output:

8589