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: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']

Answer: 28546


Question: 1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']

Answer: 7479


Question: 6, 12, ['n', 'q', '3715', 'S', '1665', 'k', 'l', '6551', 'C', '6967', '3841', '7191', 'Z', 'w', '7849', 'L', '5143', 'l', '5645', '2529', '827', 'G', '385', 'g', '9831']

Answer:
24550