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.
18, 20, ['4855', 'K', '2469', '7617', 'L', 'O', '215', 'n', '3037', '9253', '2485', 'i', 'S', 'z', '9671', 'w', 'G', '2593', '1079', '233', '3995', '2123', 'U', '5157']