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: 16, 17, ['Z', '8799', 'Z', 'P', '3413', 'X', '939', 's', 'G', 'x', '6911', 'v', '1183', '3507', 'r', 'C', 'k', 'Z', '4247']

Answer: 0


Question: 4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Answer: 439


Question: 6, 7, ['i', '1655', 'U', '8517', 'H', '6365', '9237', 'm', '8479', '785', '3281', '7183', 'E', 'Z', 'G']

Answer:
15602