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, 19, ['8101', '6977', '2259', '2655', '173', '3111', '5069', 'E', '3397', 'f', '8517', '7371', 'f', '5369', 'y', 'Q', 'n', 'Z', '4655', 'a', 'M', 'g', '4237', 'x', 'B', '7401', 'n']