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: 6, 8, ['t', 'N', 'r', '2281', 'u', 'q', 'f', 'F', 'x', '4841', '4601', '8029', 'x', 'Q', 'M', 'L', '5975', 'v', '2913', 'S', 'M', '6429', '4499']

Answer: 0


Question: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']

Answer: 471


Question: 2, 18, ['g', '1769', 'h', 'm', 'Z', '1763', '6373', 'Q', 'D', 'K', 'w', 'I', 'D', 'K', '3703', 'V', '4683', '5213', '43', 'X', 'J', '8835', '3241', 'X', '3055', 'S', 'L']

Answer:
23504