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:
1, 15, ['9611', 'm', '8001', '7451', 'O', '753', 'F', 'F', '3017', '8265', 'j', '5753', 'B', 'Q', '4079', 'k', 'N', '5197', '3885', '3193']
answer:
46930


question:
1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
answer:
33375


question:
19, 25, ['y', 'Y', '7479', '2529', 'z', '1961', 'x', '9085', 'F', 'T', '3425', '2339', 'N', 'P', '8339', '8095', 'J', '9133', 'p', 'M', 'y', 'i', '7063', '3067', 'R', '4509', '9543']
answer:

10130