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, 25, ['y', 'r', '639', '6501', '7755', 'A', 'v', 't', '3209', '7899', 'Z', '6099', 'Q', 'L', 'T', 'b', 'P', '6913', 'J', '8855', '551', '4509', '143', '9331', 'c']
answer:
47509


question:
1, 1, ['D', 'W', '5783']
answer:
0


question:
3, 15, ['u', '4219', 'k', '2901', 'N', '9687', '5671', '3925', 'O', '8153', 'j', '3115', 'M', '6193', 'w', 'y', '6375', 'v']
answer:

39645