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, 18, ['3365', 's', '7377', '4891', '6885', '165', 'w', '3893', 'E', '5357', '5107', '741', '23', '3549', 'U', 'B', 'E', '6295', 'B', 'w', 'B', 'm', '7105', 'K', '6921', '7529']