A knight's tour is the sequence of moves of a knight on a chessboard such that the knight visits every square exactly one time. Your task, quite simply, is to determine whether a knight's tour can be made given an m * n chessboard and a x, y start position on said m * n board.
Input Format
Two lines, each containing two numbers. The first represents m and n (respectively) and the second represents the x and y position (respectively)
Sample Input
7 7
3 4
Output Format A single line stating either "true" or "false"
Sample Output
trueYou must be logged in to submit a solution.