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: 2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']

Answer: 22725


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, 28, ['2201', 'f', '3059', '4941', '9693', 'C', '7583', 'C', 'C', '3145', 'N', '8421', '833', '3505', '3181', 'u', 'E', 'S', 'S', '9965', '5957', '9017', '5541', 'I', '6909', 's', '6325', 'n']

Answer:
85016