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:
5, 6, ['F', 'u', '4899', 'P', '2029', 'A', '9641', '8201', 'e', 'g', 'Y', '3483', 'y', '6515', 'S']

Ex Output:
2029


Ex Input:
3, 4, ['2879', '5161', 'v', 'c', 'P', 'T', 'p', '6905', 'F']

Ex Output:
0


Ex Input:
1, 7, ['E', '3231', '1689', '1067', '6717', '3431', '9419', '6749']

Ex Output:

25554