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: 2, 10, ['9653', '3845', 'm', 'K', 'j', '5041', 'W', 's', 'j', 'A', 'G']

Answer: 8886


Question: 3, 17, ['f', '4225', 'n', 'K', 'w', 'a', 'N', 'S', '7859', '5943', 'B', 't', '6581', '2899', 'j', 'n', '3607', 'n']

Answer:
26889