#include <bits/stdc++.h>
using namespace std;

const int maxn = 1010;
int n, m, A, B;
bool used[1010][1010];
char ans[1010][1010];

int main() {
    scanf("%d %d %d %d", &n, &m, &A, &B);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            ans[i][j] = '.';
        }
    }
    int oldn = n, oldm = m;
    if (n & 1) {
        for (int i = 1; i < m; i++) {
            if (A && !used[n][i] && !used[n][i + 1]) {
                used[n][i] = used[n][i + 1] = 1, A--;
                ans[n][i] = '<', ans[n][i + 1] = '>';
            }
        }
        n--;
    }
    if (m & 1) {
        for (int i = 1; i < n; i++) {
            if (B && !used[i][m] && !used[i + 1][m]) {
                used[i][m] = used[i + 1][m] = 1, B--;
                ans[i][m] = '^', ans[i + 1][m] = 'v';
            }
        }
        m--;
    }
    if (oldn & 1 && oldm & 1 && (A + B) * 2 == n * m && A & 1) {
        A--, B--;
        ans[n - 1][m - 1] = '<', ans[n - 1][m] = '>';
        ans[n + 1][m] = '<', ans[n + 1][m + 1] = '>';
        ans[n - 1][m + 1] = '^', ans[n][m + 1] = 'v';
        ans[n][m - 1] = '^', ans[n + 1][m - 1] = 'v';
    }
    for (int i = 1; i <= n; i += 2) {
        for (int j = 1; j <= m; j += 2) {
            if (A) {
                A--, ans[i][j] = '<', ans[i][j + 1] = '>';
                if (A) A--, ans[i + 1][j] = '<', ans[i + 1][j + 1] = '>';
            } else if (B) {
                B--, ans[i][j] = '^', ans[i + 1][j] = 'v';
                if (B) B--, ans[i][j + 1] = '^', ans[i + 1][j + 1] = 'v';
            }
        }
    }
    if (A || B) {
        printf("NO\n"), exit(0);
    }
    printf("YES\n");
    for (int i = 1; i <= oldn; i++) {
        printf("%s\n", ans[i] + 1);
    }
    return 0;
}
### Prompt

Please provide a cpp coded solution to the problem described below:

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>
using namespace std;

const int maxn = 1010;
int n, m, A, B;
bool used[1010][1010];
char ans[1010][1010];

int main() {
    scanf("%d %d %d %d", &n, &m, &A, &B);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            ans[i][j] = '.';
        }
    }
    int oldn = n, oldm = m;
    if (n & 1) {
        for (int i = 1; i < m; i++) {
            if (A && !used[n][i] && !used[n][i + 1]) {
                used[n][i] = used[n][i + 1] = 1, A--;
                ans[n][i] = '<', ans[n][i + 1] = '>';
            }
        }
        n--;
    }
    if (m & 1) {
        for (int i = 1; i < n; i++) {
            if (B && !used[i][m] && !used[i + 1][m]) {
                used[i][m] = used[i + 1][m] = 1, B--;
                ans[i][m] = '^', ans[i + 1][m] = 'v';
            }
        }
        m--;
    }
    if (oldn & 1 && oldm & 1 && (A + B) * 2 == n * m && A & 1) {
        A--, B--;
        ans[n - 1][m - 1] = '<', ans[n - 1][m] = '>';
        ans[n + 1][m] = '<', ans[n + 1][m + 1] = '>';
        ans[n - 1][m + 1] = '^', ans[n][m + 1] = 'v';
        ans[n][m - 1] = '^', ans[n + 1][m - 1] = 'v';
    }
    for (int i = 1; i <= n; i += 2) {
        for (int j = 1; j <= m; j += 2) {
            if (A) {
                A--, ans[i][j] = '<', ans[i][j + 1] = '>';
                if (A) A--, ans[i + 1][j] = '<', ans[i + 1][j + 1] = '>';
            } else if (B) {
                B--, ans[i][j] = '^', ans[i + 1][j] = 'v';
                if (B) B--, ans[i][j + 1] = '^', ans[i + 1][j + 1] = 'v';
            }
        }
    }
    if (A || B) {
        printf("NO\n"), exit(0);
    }
    printf("YES\n");
    for (int i = 1; i <= oldn; i++) {
        printf("%s\n", ans[i] + 1);
    }
    return 0;
}
```