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, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']

Ex Output:
8825


Ex Input:
1, 8, ['D', '1285', '5209', '1711', '9729', 'C', '2863', '9595', 'F', 'f', '8515', 'g', 'e', '2363']

Ex Output:
30392


Ex Input:
4, 7, ['G', '783', 'C', 'L', 'v', 'g', '6791', 'Y', '7203', '4619', 'Y', 'Z', '4105', '921', '5253', '3455', 'A', '8125', '8519', '6943', '1515']

Ex Output:

6791