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:
12, 15, ['I', 'H', '3483', '6289', 'X', '5705', '7707', 'x', 'J', 'c', '5161', '9653', '3949', 'l', 'b', 'C', 's', '17', 'a', '4231', 't']
answer:
13602


question:
4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']
answer:
22271


question:
10, 20, ['o', '923', '8177', '2857', '2237', '5269', '5397', '5933', 'f', '5037', 'l', 'o', '4931', '4889', 'h', '4121', '6651', 'w', '1717', '5069', 'I', '5975', 'F', '6105', '2473', '341', '5499', 'p']
answer:

32415