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: 8, 26, ['n', '9063', 'c', 'k', '7515', 'm', '2261', '4297', '9817', '7599', '1669', 'l', '9837', '3021', 'Q', '3991', 'r', 'B', '8615', 'J', '5641', '7637', '469', '3571', '2265', '3969']

Answer: 72398


Question: 4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']

Answer: 6933


Question: 1, 27, ['7733', 'N', '1859', 'y', '6697', '8337', '7827', 'm', '6953', 'E', '8071', '9821', '7415', 'G', 'O', 'r', '3209', '6535', 'y', 'C', '7963', '1869', 'E', '3207', '3071', '2151', '5279', 'Z']

Answer:
97997