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, 10, ['935', 't', '655', 'P', '2565', '9425', 'U', '8241', '9919', 'p', '1417', 'X', 'q', 'g', '2377', 'D']