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.
9, 16, ['s', '5729', 'Y', '3237', '497', 'X', '9485', 'w', 'K', '3551', '1275', '8631', 'I', 'l', '2477', 'e', '5881', '9089', 't', 'J', 'T', '9557', '755']