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, 16, ['6307', '8709', 'd', '9345', 'D', '3885', 'b', 'w', '367', 'Q', '1215', 'o', 't', '2809', 's', '6321', 'm', '6439', '4057', '9545', 'l', '3735', 'E', '8763', '7239', '1979']