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.
19, 27, ['y', 'R', 's', 'D', 'u', '3229', 'h', '4589', '4259', '8249', 'w', 'Z', '3867', '9569', 'f', 'l', '4755', 'x', '1585', 'U', 'a', 'T', '545', 'e', 'M', '1449', 'Q', '1573', '1375', 'X']