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, 15, ['r', '6933', '8849', '3479', 'H', '4269', '7469', '9359', 'K', '3371', 'A', '5371', 'z', 'K', '6147', 'i', 'Q', '9055', 'b', 'g', 'x', '5357', 'L', '2797', '7683', 'L', '7127', 'M']

Ex Output:
35986


Ex Input:
2, 10, ['1711', '201', '6463', 'J', 'z', 'D', 'I', 's', '2161', 'I', '2479', '4475', '2519', '7511']

Ex Output:
8825


Ex Input:
2, 5, ['c', 'R', 't', '1235', '9665', 'k']

Ex Output:

10900