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.
14, 21, ['K', 'r', '9153', '8445', 'j', 'q', '4337', '6959', '9475', '841', 'F', '5307', '7989', '127', '6299', 'A', 'Z', '8915', 'x', 'u', 'b', '3025', 'S', 'T', 'F', 'm', '8089', 'o']