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:
16, 16, ['V', '9929', 'S', 'g', '1751', 'd', 'G', 't', '9289', '6139', 'J', 'T', 'W', '8085', '7747', 'j', '5657', '8875']
answer:
0


question:
3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']
answer:
9114


question:
15, 18, ['6639', 'z', '2133', '8705', '4887', '9125', '5515', '2001', 'A', '9131', 'n', 'f', 'd', 'I', '7829', '641', 'b', 'v', 'o', 'i', '3335', 'H', 'Y', 'E', 'b']
answer:

8470