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: 19, 19, ['4147', '1103', '5749', 'c', '5103', '3491', '4511', '197', 'T', '1601', 'J', 'c', '1309', 'a', '607', 'p', 'C', '9473', '5221', 'D', 'U', 'O', '5013']

Answer: 5221


Question: 4, 5, ['677', '5585', 'W', 'J', 'C']

Answer: 0


Question: 1, 22, ['s', 'n', 'B', '393', '5475', 't', 'q', '1455', 'a', 'Z', 'z', '797', 'w', '2911', 'o', 'B', '817', 'F', '9683', 'A', '3295', 'G', 'b', 'j', '1763', 'F', '2863', '7499', '8481']

Answer:
24826