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:
2, 5, ['8407', '1329', '2243', '2547', '5371', '6023', '7139', 'K', '339', '3301', '6771', 'Z', '9983', '17', 'V']

Ex Output:
11490


Ex Input:
6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']

Ex Output:
13298


Ex Input:
5, 10, ['a', '7359', '4707', 'o', '8063', '587', 'w', '9091', 'W', 'J', '6323', 'b', 'C', '731', '4715', 'A', 'A', '5829', 'T', '8081', 'L', '4167', '1947', '7295']

Ex Output:

17741