Problem Statement

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:

• All the tiles must be placed on the grid.
• Tiles must not stick out of the grid, and no two different tiles may intersect.
• Neither the grid nor the tiles may be rotated.
• Every tile completely covers exactly two squares.

Input

Input is given from Standard Input in the following format:
N M A B

Output

If it is impossible to place all the tiles, print NO.
Otherwise, print the following:
YES
c_{11}...c_{1M}
:
c_{N1}...c_{NM}

Here, c_{ij} must be one of the following characters: ., <, >, ^ and v. Represent an arrangement by using each of these characters as follows:

• When c_{ij} is ., it indicates that the square at the i-th row and j-th column is empty;
• When c_{ij} is <, it indicates that the square at the i-th row and j-th column is covered by the left half of $a 1 \times 2$ tile;
• When c_{ij} is >, it indicates that the square at the i-th row and j-th column is covered by the right half of $a 1 \times 2$ tile;
• When c_{ij} is ^, it indicates that the square at the i-th row and j-th column is covered by the top half of $a 2 \times 1$ tile;
• When c_{ij} is v, it indicates that the square at the i-th row and j-th column is covered by the bottom half of $a 2 \times 1$ tile.

Constraints

• $1 \leq N,M \leq 1000$
• $0 \leq A,B \leq 500000$
• N, M, A and B are integers.

Sample Input 1

3 4 4 2

Sample Output 1

YES
<><>
^<>^
v<>v

This 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.

Sample Input 2

4 5 5 3

Sample Output 2

YES
<>..^
^.<>v
v<>.^
<><>v

Sample Input 3

7 9 20 20

Sample Output 3

NO

见题面 Input 部分

见题面 Output 部分