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.
13, 27, ['B', 'x', '4981', '2503', 'D', 'J', 'i', 'U', 'A', '8609', 'L', '4877', 'u', 'n', 'b', 'y', '4925', 'm', 'u', 'B', '9339', '7331', '6253', 'g', 'Q', '9509', '125', '859']