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.
8, 23, ['w', 'K', '905', '9413', 'D', 'r', '5869', 'p', '2463', '9723', 'T', 'l', '1735', 'w', 'U', 'w', '3819', '5357', 'A', 'e', '1465', '1289', '8273']