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.
20, 23, ['C', 'e', 'G', 'C', '53', 'Y', '879', '1531', '4115', 'y', 'x', '13', '1721', 'K', 'I', 'B', 'e', '9177', '8115', '563', '5067', 'e', 'o', '4731', 'E', 'h']