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:
11, 12, ['S', 'f', 'V', '7983', 'O', 'k', '699', '2831', 'C', 'B', 'B', '1263', 'b', '509', '8963', '8895']
answer:
1263


question:
3, 14, ['Y', '9099', 'H', 'D', 'M', '1111', 'N', '4939', 'b', 'Y', '13', 'L', 'J', '4045', '2005', 'F', 'O', '1495', 'J', 'h', 'G']
answer:
10108


question:
6, 14, ['d', '1863', 'R', '9443', '8241', '7223', 'h', 'P', '2799', 'k', '6645', 'y', 'x', '9525', 'D', '1685', '1689', 'k', 'j', '5939']
answer:

26192