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.
9, 17, ['u', 'p', '2281', 'X', 'l', '7241', '6445', '7847', '1015', 'R', 'A', '1517', 'j', 'Z', 'X', 'z', '623', '4609', 'm', 'l', '3947', 'U', 'b']