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.
7, 12, ['f', 'P', 'b', '6465', '4693', 'b', 'Y', '5001', 'S', '9267', '2691', '2059', '8329', 'z', 'O', '9359', '6633', 'z', 'L', 'E', 'R', 'O', '4799', '8971']