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, 12, ['8515', '4987', '7905', 'K', 'u', '2791', 'o', '8955', 'j', 'x', 'e', 'Z', '6231', '4913', '7933', '4079', '2945', '475', '6415', 'V', '8767', 't', 'c', '919', 'M', '5501', 'y', 'S', 'L', 'Q']
answer:
0


question:
5, 6, ['937', '3595', '1279', '8705', '3587', '5879']
answer:
9466


question:
3, 7, ['2065', 'Q', '7741', '1053', 'n', 'u', '4125', '8905', '5579', 'z', 'O', 't', 'e', '3273', 'k', '2759']
answer:

12919