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: 4, 25, ['5003', '1565', '5397', '415', '6045', '9119', '3383', '5449', 'v', 'C', 'J', 'w', '7791', 'F', 'O', '8827', '7171', '2709', 'f', 'W', 'P', '5175', 'D', '135', 'W', '7021', 'T', 's', '7949']

Answer: 56219


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

Answer: 6933


Question: 7, 8, ['6971', '6735', '5141', 't', 'c', '4839', 'B', '9315', 'f', '7229', 'u', '319', 'f', 'T', '9569', '8849']

Answer:
9315