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.
12, 16, ['G', 'W', '8965', 'Z', '8197', '9017', '3425', 'G', '1085', '6431', 'Q', '8201', 'u', '7229', '5853', '8763', '7403']