#include <iostream>
#include <cstdio>
using namespace std;

int n, m, s1, s2;
char a[1005][1005];
void f(int p, int q) {
	if (a[p][q] == '.' && a[p + 1][q] == '.') {
		a[p][q]='^';
		a[p + 1][q] = 'v';
		s2--;
	}
}

void g(int p, int q) {
	if (a[p][q] == '.' && a[p][q + 1] == '.') {
		a[p][q]='<';
		a[p][q + 1] = '>';
		s1--;
	}
}
int main()
{
	int i, j;
	cin >> n >> m >> s1 >> s2;
	for (i= 0; i < n; i++) {
		for (j = 0; j < m; j++) {
			a[i][j] = '.';
		}
	}
	if (m % 2 ==1) {
//		for (i = 0; i + 1 < n; i += 2) f(i, m - 1);
		for (i = 0; i + 1 < n && s2; i += 2) f(i, m - 1);
		if (s2 > 0 && m >= 3 && n >= 3 && s2 % 2 == 1) f(n - 2, m - 3);
	}
	for (i = 0; i + 1 < n; i++) {
		for (j = 0; j < m; j++) {
			if (s2 == 0) break;
			f(i, j);
		}
		if (s2 == 0) break;
	}
	for (i =0; i < n; i++) {
		for (j = 0; j + 1 < m; j++) {
			if(s1 == 0) break;
			g(i, j);
		}
		if (s1 == 0) break;
	}
	if (s1 == 0 && s2 == 0) {
		cout << "YES" << endl;
		for (i = 0; i < n; i++) {
			printf("%s\n",a[i]);
		}
	} else {
		cout << "NO" << endl;
	}
    return 0;
}

### Prompt

Create a solution in CPP for 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 <iostream>
#include <cstdio>
using namespace std;

int n, m, s1, s2;
char a[1005][1005];
void f(int p, int q) {
	if (a[p][q] == '.' && a[p + 1][q] == '.') {
		a[p][q]='^';
		a[p + 1][q] = 'v';
		s2--;
	}
}

void g(int p, int q) {
	if (a[p][q] == '.' && a[p][q + 1] == '.') {
		a[p][q]='<';
		a[p][q + 1] = '>';
		s1--;
	}
}
int main()
{
	int i, j;
	cin >> n >> m >> s1 >> s2;
	for (i= 0; i < n; i++) {
		for (j = 0; j < m; j++) {
			a[i][j] = '.';
		}
	}
	if (m % 2 ==1) {
//		for (i = 0; i + 1 < n; i += 2) f(i, m - 1);
		for (i = 0; i + 1 < n && s2; i += 2) f(i, m - 1);
		if (s2 > 0 && m >= 3 && n >= 3 && s2 % 2 == 1) f(n - 2, m - 3);
	}
	for (i = 0; i + 1 < n; i++) {
		for (j = 0; j < m; j++) {
			if (s2 == 0) break;
			f(i, j);
		}
		if (s2 == 0) break;
	}
	for (i =0; i < n; i++) {
		for (j = 0; j + 1 < m; j++) {
			if(s1 == 0) break;
			g(i, j);
		}
		if (s1 == 0) break;
	}
	if (s1 == 0 && s2 == 0) {
		cout << "YES" << endl;
		for (i = 0; i < n; i++) {
			printf("%s\n",a[i]);
		}
	} else {
		cout << "NO" << endl;
	}
    return 0;
}

```