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, 26, ['8735', 'g', 'h', 'g', '6119', '6217', '23', '2501', '8057', 'v', 'a', '6777', 'e', '2795', '943', 'W', '7217', 'y', 'Y', 'O', 'E', '3021', '1075', '8913', 'v', 'w', '5295', '3197', '1103', '2381']