{"raw_statement":[{"iden":"problem statement","content":"Takahashi has an $N \\times M$ grid, with $N$ horizontal rows and $M$ vertical columns. Determine if we can place $A$ $1 \\times 2$ tiles ($1$ vertical, $2$ horizontal) and $B$ $2 \\times 1$ tiles ($2$ vertical, $1$ horizontal) satisfying the following conditions, and construct one arrangement of the tiles if it is possible:\n\n*   All the tiles must be placed on the grid.\n*   Tiles must not stick out of the grid, and no two different tiles may intersect.\n*   Neither the grid nor the tiles may be rotated.\n*   Every tile completely covers exactly two squares."},{"iden":"constraints","content":"*   $1 \\leq N,M \\leq 1000$\n*   $0 \\leq A,B \\leq 500000$\n*   $N$, $M$, $A$ and $B$ are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$ $A$ $B$"},{"iden":"sample input 1","content":"3 4 4 2"},{"iden":"sample output 1","content":"YES\n<><>\n^<>^\nv<>v\n\nThis is one example of a way to place four $1 \\times 2$ tiles and three $2 \\times 1$ tiles on a $3 \\times 4$ grid."},{"iden":"sample input 2","content":"4 5 5 3"},{"iden":"sample output 2","content":"YES\n<>..^\n^.<>v\nv<>.^\n<><>v"},{"iden":"sample input 3","content":"7 9 20 20"},{"iden":"sample output 3","content":"NO"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}