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, 17, ['1039', '4159', 'm', '9483', 'T', '9353', 'p', '9583', '3269', 'X', 'f', 'I', 'Y', 'p', 'b', '8893', 'r', 'H', 'f', 'z', '3077', 'U']