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:
8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
answer:
5430


question:
2, 19, ['u', 'x', '1103', 'K', 'N', 'o', '1943', 'Z', 'r', 'B', 'N', 'e', '7289', 'S', '325', 'G', 'x', 'D', '9005', 'y', '1729', '961', '4621', 'D', 'u', '1235']
answer:
19665


question:
9, 19, ['9903', '1785', '4403', '9413', '6301', 'Y', 'T', 'r', '9821', '8963', '2263', '9491', '9381', '1897', '3295', 'n', 'A', '2219', '9175', 'I']
answer:

56505