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.
9, 12, ['x', 'z', 'A', '7903', '361', '1061', 'x', 'U', '4855', 'A', 'G', '337', 'F', 'P', 'o', 'H', 'k', 'n', '703', '5745', 'm', 'b', '5651', 'Q']