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.
3, 27, ['R', 'z', 'W', 'I', '4273', 'z', '431', 'w', 'E', 'W', 'D', '4181', 'h', '7571', 'I', '9173', 'P', '3139', 'j', 'd', 'k', 'r', 'd', '8215', '687', '8985', '8371', '133']