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.
5, 9, ['3811', 'z', '825', 'c', 'K', 'P', '6371', 'U', '6965', '8361', 'z', 'f', 't', '291', 'G', 'p', 'g', '833', 'a', '7589', '1939']