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


question:
1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
answer:
0


question:
5, 24, ['4667', 'n', '5695', '8635', 'n', '2349', '7349', 'X', '7413', 'T', 'g', '6549', '65', '9035', '5195', 'T', 'I', 'g', 'v', 'f', '1959', 'K', '7109', 'o', 'F']
answer:

47023