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: 3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']

Answer: 45165


Question: 7, 25, ['4553', 'a', '1517', 'C', '7915', '3485', '1395', '3203', '2135', '1889', 'r', 'O', 'v', 'c', '8053', 'D', 'S', '6501', 'L', '6559', 'v', 'P', 'l', 'O', '1143']

Answer:
30878