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, 2, ['4965', '6219']

Answer: 6219


Question: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']

Answer: 0


Question: 2, 14, ['g', '5999', 'o', '2371', 'V', '1519', 'r', 'a', '3069', 'K', '1941', '4677', '6459', 'T', '3911', '3771', 'b', 'X', '9543', 'D', 'R', '1329', 'd']

Answer:
26035