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:
5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
answer:
9466


question:
4, 9, ['k', 'N', 'd', '9345', '2971', 'Q', '917', 'X', '417', 'y', 'B', '6149', '9769', '9949', '2339', 'Q', 'A', 'r', '1059', 'c', 'U', 'p', '6951', 'Z', 'F', '7753', 'g']
answer:
13650


question:
8, 25, ['9661', 'Z', '7009', 'c', 'G', '931', '4393', '7455', 'E', 'C', 'T', '1391', '8391', 'l', 'C', '3527', '4863', '8903', 'l', 'c', 'j', 'U', '9853', '2569', 'b', '931', 'f']
answer:

46952