#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int T, A, B;
	while(cin >> T >> A >> B) {
		if(max(A, B) > T || (A == 0 && B == 0 && T == 1)) {
			puts("NO");
			continue;
		}
		vector<string> v, ans;
		if(A == 0 && B == 0) {
			while(T > 3) {
				ans.push_back(">");
				ans.push_back("<");
				T -= 2;
			}
			if(T == 2) {
				ans.push_back(">");
				ans.push_back("<");
			}else if(T == 3) {
				ans.push_back(">");
				ans.push_back("^");
				ans.push_back("<v");
			}
		}else {
			rep(i, min(A, B))
				v.push_back("^>");
			reu(i, min(A, B), A)
				v.push_back("^");
			reu(i, min(A, B), B)
				v.push_back(">");
			rep(i, (T - max(A, B)) / 2) {
				ans.push_back(">");
				ans.push_back("<");
			}
			if((T - max(A, B)) % 2 == 1) {
				assert(!v.empty());
				if(v[0] == "^>") {
					ans.push_back(">");
					ans.push_back("^");
				}else if(v[0] == ">") {
					ans.push_back(">^");
					ans.push_back("v");
				}else if(v[0] == "^") {
					ans.push_back(">^");
					ans.push_back("<");
				}else {
					assert(false);
				}
				ans.insert(ans.end(), v.begin() + 1, v.end());
			}else {
				ans.insert(ans.end(), v.begin(), v.end());
			}
		}
		cout << "YES" << endl;
		each(i, ans)
			cout << *i << endl;
	}
	return 0;
}