// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
//#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
// #define mt make_tuple
//typedef tuple<pii,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	int n,m,a,b;
	cin>>n>>m>>a>>b;
	if(n+m==2){
		if(a||b)cout<<"NO"<<endl;
		else cout<<"YES"<<endl<<"."<<endl;;
		return 0;
	}
	vs s(n,string(m,'.'));
	if(m%2)rep(i,n/2){
		if(b){
			s[i*2][m-1]='^';
			s[i*2+1][m-1]='v';
			b--;
		}
	}
	if(n%2)rep(i,m/2){
		if(a){
			s[n-1][i*2]='<';
			s[n-1][i*2+1]='>';
			a--;
		}
	}
	rep(i,n/2)rep(j,m/2){
		if(a>=2){
			s[i*2][j*2]='<';
			s[i*2][j*2+1]='>';
			s[i*2+1][j*2]='<';
			s[i*2+1][j*2+1]='>';
			a-=2;
		}else if(b>=2){
			s[i*2][j*2]='^';
			s[i*2+1][j*2]='v';
			s[i*2][j*2+1]='^';
			s[i*2+1][j*2+1]='v';
			b-=2;
		}else if(a){
			s[i*2][j*2]='<';
			s[i*2][j*2+1]='>';
			a--;
		}else if(b){
			s[i*2][j*2]='^';
			s[i*2+1][j*2]='v';
			b--;
		}
	}
	if(a+b==1&&n%2&&m%2){
		if(b){
			if(s[n-1][m-2]!='.'){
				s[n-1][m-1]='>';
				s[n-1][m-2]='<';
			}
			if(s[n-2][m-3]=='.'){
				s[n-1][m-3]='v';
				s[n-2][m-3]='^';
				b--;
			}
		}
	}
	if(a||b)cout<<"NO"<<endl;
	else{
		cout<<"YES"<<endl;
		rep(i,n)cout<<s[i]<<endl;
	}
}







### Prompt

Develop a solution in Cpp 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
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
//#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
// #define mt make_tuple
//typedef tuple<pii,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	int n,m,a,b;
	cin>>n>>m>>a>>b;
	if(n+m==2){
		if(a||b)cout<<"NO"<<endl;
		else cout<<"YES"<<endl<<"."<<endl;;
		return 0;
	}
	vs s(n,string(m,'.'));
	if(m%2)rep(i,n/2){
		if(b){
			s[i*2][m-1]='^';
			s[i*2+1][m-1]='v';
			b--;
		}
	}
	if(n%2)rep(i,m/2){
		if(a){
			s[n-1][i*2]='<';
			s[n-1][i*2+1]='>';
			a--;
		}
	}
	rep(i,n/2)rep(j,m/2){
		if(a>=2){
			s[i*2][j*2]='<';
			s[i*2][j*2+1]='>';
			s[i*2+1][j*2]='<';
			s[i*2+1][j*2+1]='>';
			a-=2;
		}else if(b>=2){
			s[i*2][j*2]='^';
			s[i*2+1][j*2]='v';
			s[i*2][j*2+1]='^';
			s[i*2+1][j*2+1]='v';
			b-=2;
		}else if(a){
			s[i*2][j*2]='<';
			s[i*2][j*2+1]='>';
			a--;
		}else if(b){
			s[i*2][j*2]='^';
			s[i*2+1][j*2]='v';
			b--;
		}
	}
	if(a+b==1&&n%2&&m%2){
		if(b){
			if(s[n-1][m-2]!='.'){
				s[n-1][m-1]='>';
				s[n-1][m-2]='<';
			}
			if(s[n-2][m-3]=='.'){
				s[n-1][m-3]='v';
				s[n-2][m-3]='^';
				b--;
			}
		}
	}
	if(a||b)cout<<"NO"<<endl;
	else{
		cout<<"YES"<<endl;
		rep(i,n)cout<<s[i]<<endl;
	}
}







```