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.
21, 21, ['6287', 'K', 'M', '5669', 't', '6037', '5705', 'P', 'P', '3213', 'f', 'o', '3155', '657', 'M', '7213', 'h', 'g', '7271', '3133', 'K', '4975', '1059', '9633', 'U', '8613', 'E']