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: 9, 12, ['8515', '4987', '7905', 'K', 'u', '2791', 'o', '8955', 'j', 'x', 'e', 'Z', '6231', '4913', '7933', '4079', '2945', '475', '6415', 'V', '8767', 't', 'c', '919', 'M', '5501', 'y', 'S', 'L', 'Q']

Answer: 0


Question: 9, 14, ['6203', 'i', 'j', 'M', 'T', 'n', 'M', '9235', '3531', 'L', 'L', '7915', '3383', 'o', 'c', 't', '4257', 'e', 'Q', 'G', 'y', '1681', 'N', 'q', 'K']

Answer:
14829