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.
4, 16, ['w', 'J', 'K', 'C', '4643', 'p', 'a', '8865', '349', 'm', '2161', '23', '3439', '5215', 'L', '8467', 'q', 'y', '4013', '4493', '9597']