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, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']

Answer: 12664


Question: 6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']

Answer: 3811


Question: 8, 12, ['E', 'O', 'k', '835', '1017', '8915', 'M', '8197', 'T', '3635', '3565', '6193', 'q', '8117', '8921', 'p', '2573', 'U', '1299', 'Q', 'i', 'H', '7959', '6141']

Answer:
21590