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: 7, 19, ['8309', 'O', '1491', 'k', '2521', '1161', 'y', '3215', '8345', '1949', '9883', 'g', 'z', 'B', 'S', 'j', 't', '2841', 'j', '3333', 'S', 'w', '2283', '793', 'w', 'q', 'p', 'J', '7979']

Answer: 26233


Question: 3, 5, ['i', 'e', '6583', '313', '5511']

Answer: 12407


Question: 4, 17, ['V', '4897', '2151', '9135', 'D', '8939', '2017', '407', 'W', 'W', '4167', '4409', '4405', '2747', 'S', '345', '5065', 'h', '1995', 'v', 'R']

Answer:
41636