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.
--------
Question: 1, 12, ['m', 'f', 'y', '2363', '9555', 'E', 'm', 'J', '1977', 'z', '3733', '9745', 'm', 'u', '1033', 'x', '7351', 'O', 'W', '8311', '955', '8643', 'D', 'e', 'z', 'M', '5139', 'o', 'a']

Answer: 27373


Question: 5, 6, ['6675', '1045', '5697', '8385', 'R', '8979', '2187', 'L', 'w', '9711', 'e', '9789', 'f', 'c', 'C', '8189', '131', '8163']

Answer: 8979


Question: 5, 6, ['G', 'C', '6039', '905', 'a', '3751', 'p', '1879', '8069', '6829', 'Q', 'b', '9315', 'p', '9097', '175', '7663', '4617', 'M', '8837', 'p']

Answer:
3751