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.
10, 16, ['q', '5959', '6967', 'u', '1799', '2911', '5345', '8123', 'J', '1443', '8981', '2885', '5259', 'Z', 'K', 'A', 'w']