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:
2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']
answer:
1351


question:
17, 22, ['D', '7897', '1603', 'L', '5485', 'S', 'V', '1361', 'a', '9131', 'm', 'V', 'l', 'v', 'Z', '4831', '9561', '1185', 'y', 'D', '1853', '2225', 'j', 'r']
answer:
14824


question:
16, 19, ['9765', 'D', '7571', '5373', 'C', 'J', 'u', 'O', '8849', '8801', 'P', 'x', 'B', 'C', '9013', 'Z', 'Q', '4537', '9259']
answer:

13796