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:
6, 13, ['x', '8293', 'W', 'O', '511', 'y', '9801', '7925', '3353', 'J', 'D', 'J', 'B', '2559', 'j']
answer:
21079


question:
2, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
answer:
22725


question:
4, 23, ['273', 'Y', '6067', '3201', 'U', '1127', 'F', '417', 'k', 'F', '9413', '3999', '8545', '5937', '2249', 'q', '727', '2031', '5319', '9477', 'G', 'v', '8835', '5259']
answer:

61277