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: 3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Answer: 0


Question: 8, 14, ['i', '2929', '9353', 'T', '5451', 'n', 'y', '2861', 's', 'G', '7717', '3833', '3753', 'u', 'E', 'T', 'I']

Answer: 18164


Question: 1, 15, ['M', 'k', 'f', '955', 'D', 'x', '9915', '1797', 'i', '345', '3117', 'j', '6545', '8323', '8587', 'k']

Answer:
39584