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.
6, 11, ['1807', 'R', '4989', '4241', '1245', 'U', 't', '3133', 'o', 't', 'X', '7253', '5589', 'E', '3173', 'y', '1771', 'e', '7315', 'r', 'A', 'L']