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.

Q: 6, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']

A: 49687
****
Q: 1, 15, ['9611', 'm', '8001', '7451', 'O', '753', 'F', 'F', '3017', '8265', 'j', '5753', 'B', 'Q', '4079', 'k', 'N', '5197', '3885', '3193']

A: 46930
****
Q: 19, 25, ['2619', 'X', 'f', '5559', 'h', 'u', '5849', '1339', 't', 'Y', '6351', '1051', '8811', 'v', 'G', '3985', 'u', 'r', '5607', '5723', 'B', '9075', '5797', '4855', 'e', '8917', '2213', 'r']

A:
31057
****
