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: 2, 2, ['M', 'I', 'G', '3747']

Answer: 0


Question: 12, 17, ['3889', 'F', 'E', '8903', '2149', '2549', '5827', '7333', '1321', '3', 's', 'e', '2009', '711', 'Q', '7555', 'T', '8479', '8685', 'Y', 'W']

Answer: 10275


Question: 4, 12, ['t', 'S', '4737', '867', '6683', 'O', 'v', '3615', 'k', '807', 'm', 'M', '5721', '5463', '993', 'O', 'z', 'W', 'X', '7937', 'd', '9891', '2961', '2639']

Answer:
11972