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.

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']
35986

1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']
30959

1, 5, ['o', 'A', 'Z', '8985', 'z', '709', 'T', 'C', 'E', '4363', '6985', 'Q', '291', 'l', 'R', 'U', 'Y', 'g', '8435', 'q', '1995', 's', 'T', '4971']

8985