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, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']
answer:
23384


question:
1, 1, ['x', 'g', 'X', 'j', 'k', '9821', 'n', 'd', '1709', 'r']
answer:
0


question:
24, 27, ['H', '1247', '9731', '277', '1097', '2333', '81', 'j', '7729', 'r', 'u', 'v', '1069', '8371', 'v', '5175', '7301', '7819', '4241', '8511', '8895', 'M', 'q', '7003', 'C', '701', 'C', '1561', '9435']
answer:

7704