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: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']

Answer: 6095


Question: 13, 22, ['9357', 'K', '5563', '249', 'r', '2251', 'F', '3481', '9267', '6647', 'l', '1601', 'C', '4531', '3149', '2225', 'i', '9731', 'q', '5021', '7735', 'V', '5129', 'K', '2739', '8069', '4631', 'e', 'V']

Answer:
32392