//実装が重そうな問題はある程度考えてから書く
//初期化を忘れずに（特に二分探索とか）
//コーナーケースを考えて（特に場合分けとか）
//不可解すぎるバグは配列外参照（配列の長さ）を検討
#include "bits/stdc++.h"
#define YES "YES"
#define Yes "Yes"
#define NO "NO"
#define No "No"
#define YESNO(x) OUT(three(x,YES,NO))
#define YesNo(x) OUT(three(x,Yes,No))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(a);i>=(LL)(b);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,b-1,zero)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB emplace_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define int long long
#define zero 0LL
#define all ALL
#define pb PB
using namespace std;
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef long long LL;
typedef LL ll;
typedef double ld;
typedef LL ut;
const LL INF = 1LL << 60;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef priority_queue<ppr, Vppr ,greater<ppr> > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
int dx[] = { 0,1,0,-1,1,1,-1,-1,0 }, dy[] = { 1,0,-1,0,1,-1,1,-1,0 };
const int SIZE1 =2e6 + 1000;
const int SIZE2 = 2010;
const int SIZE3 = 22;
const int SIZE = SIZE1;
const LL p = 7 + 1e9;const long double EPS = 1e-7;
ut N, M, K, X, L, Y,H,W,Q,D;
// ut A,B,C,D,E,F,G,H,I,J,O,P,Q,R,T,U;
VI edges[SIZE];
LL vals[SIZE], nums[SIZE], maps[SIZE2][SIZE2], answer = zero;
//LL A[SIZE], B[SIZE],I[SIZE];
string s = ".<>^v";
LL A, B;
LL putY(int i, int j) {
	maps[i][j] = 1;
	maps[i ][j+1] =2;
	return 1;
}
LL putT(int i,int j) {
	maps[i][j] = 3;
	maps[i+1][j] = 4;
	return 1;
}
LL solve2() {
	putT(0, 0);
	putY(0, 1);
	putT(1, 2);
	putY(2, 0);
	A -= 2;
	B -= 2;
	//if (N>=3 and M>=3 and N % 2 and M % 2 and A % 2 == 0 and B % 2 == 0) return solve2();
	if (N % 2) {
		FOR(i, M % 2+2, M) {
			if (A) {
				maps[0][i] = (i - M % 2) % 2 + 1;
				if ((i - M % 2) % 2 + 1 == 2) A--;
			}
		}
	}
	if (M % 2) {
		FOR(i, N % 2+2, N) {
			if (B) {
				maps[i][0] = (i - N % 2) % 2 + 3;

				if ((i - N % 2) % 2 + 3 == 4) B--;
			}
		}
	}
	for (int i = N % 2; i < N; i += 2)
		for (int j = M % 2; j < M; j += 2) {
			if (i == 1 and j == 1) continue;
			if (A) {
				maps[i][j] = 1;

				maps[i][j + 1] = 2;
				A--;
				if (A) {
					maps[i + 1][j] = 1;
					maps[i + 1][j + 1] = 2;
					A--;
				}
			}
			else if (B) {
				maps[i][j] = 3;
				maps[i + 1][j] = 4;
				B--;
				if (B) {
					maps[i][j + 1] = 3;
					maps[i + 1][j + 1] = 4;
					B--;
				}
			}
		}
	if (A or B) {
		cout << "NO" << endl;
		return 0;

	}
	cout << "YES" << endl;
	REP(i, N) {
		REP(j, M) {
			cout << s[maps[i][j]];
		}
		cout << endl;
	}
	return 0;
}
LL solve() {
	cin >> N >> M >> A >> B;

	if (N>=3 and M>=3 and N % 2 and M % 2 and (A-M/2+1) % 2 == 0 and (B-N/2+1) % 2 == 0 and A>=N/2 and B>=N/2) return solve2();
	if (N % 2) {
		FOR(i,M%2, M) {
			if (A) {
				maps[0][i] = (i-M%2) % 2 + 1;
				if ((i - M % 2) % 2 + 1 == 2) A--;
			}
		}
	}
	if (M % 2) {
		FOR(i,N%2, N) {
			if (B) {
				maps[i][0] = (i-N%2) % 2 + 3;

				if((i - N % 2) % 2 + 3==4) B--;
			}
		}
	}
	for(int i=N%2;i<N;i+=2)
		for (int j = M % 2; j < M; j += 2) {
			if (A) {
				maps[i][j]=1;

				maps[i][j + 1] =2;				
				A--;
				if (A) {
					maps[i + 1][j] = 1;
					maps[i + 1][j + 1] = 2;
					A--;
				}
			}
			else if (B) {
				maps[i][j] =3;
				maps[i + 1][j] = 4;
				B--;
				if (B) {
					maps[i][j + 1] = 3;
					maps[i + 1][j + 1] = 4;
					B--;
				}
			}
		}
	if (A or B) {
		cout << "NO" << endl;
		return 0;
		
	}
	cout << "YES" << endl;
	REP(i, N) {
		REP(j, M) {
			cout << s[maps[i][j]];
		}
		cout << endl;
	}

	return 0;
}
signed main() {
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(10);
	solve();
	//	cin >> N;
	return 0;
}

Measured memory_bytes: 65408