#include <bits/stdc++.h>

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
  os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int MAX = 1002;
int n,m;
string res[MAX];
int a,b;
void addpoz(int i,int j){
  debug("poz",i,j);
  if(a){
    a--;
    res[i][j] = '<';
    res[i][j+1] = '>';
  }
}
void addpion(int i,int j){
  debug("pion",i,j);
  if(b){
    b--;
    res[i][j] = '^';
    res[i+1][j] = 'v';
  } 
}
void add(int i,int j){
  if(a){
    addpoz(i,j);
    addpoz(i+1,j);
  }else{
    addpion(i,j);
    addpion(i,j+1);
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
  cin >> n >> m >> a >> b;
  R(i,n){
    res[i].resize(m,'.');
  }
  if(n & 1){
    R(i,m/2){
      addpoz(n-1,i*2);
    }
  }
  if(m & 1){
    R(i,n/2){
      addpion(n - i*2 - 2,m-1);
    }
  }
  bool xxx = 0;
  if((n & 1) && (m & 1) && (a&1) && (b&1) && (n > 1) && (m > 1)){
    xxx = 1;
    addpoz(0,m-2);
    addpion(0,m-3);
  }
  R(i,n/2)R(j,m/2){
    if(xxx && i == 0 && j == m/2 - 1)continue;
    add(i*2,j*2);
  }
  if(a || b){
    cout << "NO\n";
  }else{
    cout << "YES\n";
    R(i,n)
      cout << res[i] << "\n";
  }
}

### Prompt

Construct a cpp code solution to the problem outlined:

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;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
  os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int MAX = 1002;
int n,m;
string res[MAX];
int a,b;
void addpoz(int i,int j){
  debug("poz",i,j);
  if(a){
    a--;
    res[i][j] = '<';
    res[i][j+1] = '>';
  }
}
void addpion(int i,int j){
  debug("pion",i,j);
  if(b){
    b--;
    res[i][j] = '^';
    res[i+1][j] = 'v';
  } 
}
void add(int i,int j){
  if(a){
    addpoz(i,j);
    addpoz(i+1,j);
  }else{
    addpion(i,j);
    addpion(i,j+1);
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
  cin >> n >> m >> a >> b;
  R(i,n){
    res[i].resize(m,'.');
  }
  if(n & 1){
    R(i,m/2){
      addpoz(n-1,i*2);
    }
  }
  if(m & 1){
    R(i,n/2){
      addpion(n - i*2 - 2,m-1);
    }
  }
  bool xxx = 0;
  if((n & 1) && (m & 1) && (a&1) && (b&1) && (n > 1) && (m > 1)){
    xxx = 1;
    addpoz(0,m-2);
    addpion(0,m-3);
  }
  R(i,n/2)R(j,m/2){
    if(xxx && i == 0 && j == m/2 - 1)continue;
    add(i*2,j*2);
  }
  if(a || b){
    cout << "NO\n";
  }else{
    cout << "YES\n";
    R(i,n)
      cout << res[i] << "\n";
  }
}

```