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: 3, 21, ['X', 'Z', '749', '5557', '9991', 'T', '3461', '335', 'I', 'J', '7113', 'b', '2683', '653', '3951', '4193', 'J', '7179', 'G', 'Y', '6151', '2873', 'X', '5619', '5151', '7689', '5605', 'o']

Answer: 52016


Question: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Answer: 10432


Question: 2, 12, ['c', 'C', 'p', 'M', '7735', 'Z', '2097', 's', 'q', 'w', '7215', '1661', '9869', 'K', '1251', '7351']

Answer:
18708