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.
17, 27, ['f', 'p', '3', '6567', 'C', '4069', 'K', '429', '9681', '4029', 'Y', 's', 'O', 'c', 'U', '9139', '7607', '3227', 'k', 'J', '9653', '501', '6293', 'B', 'R', 'U', '1777', 'O', '7419']