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, 1, ['R', '3969', 'O', '3281', 'X', '5173', 'K', 'G', 'm', 'Y', '4981', 'x', '9127', 'X', 'w', 'm', '3873', '5887', '7405', 't', 'P', 'K', '8459', '9699']

Answer: 0


Question: 2, 7, ['3295', '2909', '8081', '8299', '8979', 'J', 'V', 'r', '2403', '5589', '6875', '9181', '6547', 'k', 'n']

Answer: 28268


Question: 3, 22, ['4315', '1719', '557', 'X', '5357', 'V', '935', 'Q', 'y', 't', '4337', 'F', 'b', '8791', '9581', '2769', '5131', 'u', 'B', '8133', 'b', 'R', '31', 'r', 'W', '3797', '2011', '2979', 'S']

Answer:
45591