#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
using namespace std;
#define N 1005
int n,m,a,b,i,j;char mp[N][N];
int main(){
	scanf("%d%d%d%d",&n,&m,&a,&b);
	for (i=1;i<=n;i++) for (j=1;j<=m;j++) mp[i][j]='.';
	if (n&1){
		i=n,j=1;
		while (a&&j+1<=m) mp[i][j]='<',mp[i][j+1]='>',j+=2,a--;
	}
	if (m&1){
		i=n,j=m;
		while (b&&i>1) mp[i][j]='v',mp[i-1][j]='^',i-=2,b--;
	}
	for (i=n/2;i>=1;i--)
		for (j=1;j<=m/2;j++){//分成(n/2)*(m/2)个2*2的矩形 
			int x=i*2-1,y=j*2-1;
			if ((n&1)&&(m&1)&&a==1&&b==1&&i==1&&j==m/2){
				mp[x][y]='^';mp[x+1][y]='v';b--;
				mp[x][y+1]='<';mp[x][y+2]='>';a--;
			}
			if (a&&b<2){
				mp[x][y]='<';mp[x][y+1]='>';a--;
				if (a){
					x++;
					mp[x][y]='<';mp[x][y+1]='>';a--;
				}
			} else if (b){
				mp[x][y]='^';mp[x+1][y]='v';b--;
				if (b){
					y++;
					mp[x][y]='^';mp[x+1][y]='v';b--;
				}
			}
		}
	if (a||b) puts("NO");
	else{
		puts("YES");
		rep (i,1,n){rep (j,1,m) printf("%c",mp[i][j]);puts("");}
	}
	return 0;
}
### Prompt

Please create a solution in cpp to the following problem:

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.

Constraints

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

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.

Examples

Input

3 4 4 2


Output

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


Input

4 5 5 3


Output

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


Input

7 9 20 20


Output

NO

### Response

```cpp
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
using namespace std;
#define N 1005
int n,m,a,b,i,j;char mp[N][N];
int main(){
	scanf("%d%d%d%d",&n,&m,&a,&b);
	for (i=1;i<=n;i++) for (j=1;j<=m;j++) mp[i][j]='.';
	if (n&1){
		i=n,j=1;
		while (a&&j+1<=m) mp[i][j]='<',mp[i][j+1]='>',j+=2,a--;
	}
	if (m&1){
		i=n,j=m;
		while (b&&i>1) mp[i][j]='v',mp[i-1][j]='^',i-=2,b--;
	}
	for (i=n/2;i>=1;i--)
		for (j=1;j<=m/2;j++){//分成(n/2)*(m/2)个2*2的矩形 
			int x=i*2-1,y=j*2-1;
			if ((n&1)&&(m&1)&&a==1&&b==1&&i==1&&j==m/2){
				mp[x][y]='^';mp[x+1][y]='v';b--;
				mp[x][y+1]='<';mp[x][y+2]='>';a--;
			}
			if (a&&b<2){
				mp[x][y]='<';mp[x][y+1]='>';a--;
				if (a){
					x++;
					mp[x][y]='<';mp[x][y+1]='>';a--;
				}
			} else if (b){
				mp[x][y]='^';mp[x+1][y]='v';b--;
				if (b){
					y++;
					mp[x][y]='^';mp[x+1][y]='v';b--;
				}
			}
		}
	if (a||b) puts("NO");
	else{
		puts("YES");
		rep (i,1,n){rep (j,1,m) printf("%c",mp[i][j]);puts("");}
	}
	return 0;
}
```