instruction:
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:
9, 9, ['y', '689', 'X', 'X', 'u', '1839', '8779', 'O', 'O', 'A', '1559', 'A', 'U']
answer:
0


question:
3, 5, ['b', 'a', 't', 'l', '8337', 'L', '913', 'O', '1009', '3615', 'u', 'E', 'Y', 'h', '51', '1673']
answer:
8337


question:
5, 15, ['4741', '707', 'u', '5415', '4473', 't', '7239', '817', '8669', '3713', 'E', '5059', 'R', '8421', '853', '3959', '315', '599', 'l', 'P', '1697', 'T', 'C', '6549', '2889', '5533', '8987']
answer:

39244