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, 7, ['6997', '3987', '2463', 'm', 'W', 'R', 'a', 'U', 's', 'Y', 'X', '4193', '343', 'Y', '4277', 'n', 'W']

Answer: 0


Question: 2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']

Answer: 18160


Question: 26, 27, ['h', '1095', '2571', '3175', '621', 'u', '8871', 'u', '7283', '9809', 'b', 'p', '6861', 'S', 'K', '6483', '721', '6331', '8725', '8409', 'd', '4767', 'u', 'l', '661', 'w', '8997', '7135', '8025']

Answer:
8997