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.
15, 21, ['3375', '3371', '1297', '9035', 'O', 'O', 'P', '3831', 'J', 's', 'Z', '1181', '1943', '2559', 'R', 'A', '5425', '3447', '6117', 'e', '4579', 'I', '6335', 'X', '461']