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.
16, 22, ['8445', '487', '2275', '3145', 'Q', '3327', '1705', '5563', '1185', '8893', '8005', 't', 'l', '6159', '7337', '4967', '7799', '5267', '1661', 's', '4553', '3177', 'U', 'r', 'Q', '3827', '63', 'k']