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, 20, ['N', '3757', '4835', '557', 'n', '3381', '3229', '9715', 'O', 'J', '5215', 'Q', '7867', 'W', '5159', '1571', '2911', '8907', 'J', 'b']

Answer: 57104


Question: 6, 10, ['2095', '7189', 'j', 'i', '6105', 'f', 'I', 'z', '7903', '7165']

Answer: 15068


Question: 9, 10, ['1591', '79', '4557', 'J', 'R', 'A', '1063', 'p', 'o', 'u', '9173', '953', 'c', '7631', '9499', '251', 'S', 'S', 'n', 'K', 'J', '3117', 'Q', '8707', '2291', '8971', '8203', 'U', '779']

Answer:
0