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, 21, ['4367', 'l', '2469', '3449', '4601', '4027', 'X', '9215', '473', 'O', 'y', 't', '4411', 's', 'M', '7973', 'l', 'K', '5413', 'f', '8735', 'j', 'Y', '8575', '6231', 'e']