#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()



void approach(int& a, int& b, int A, int B, int& T)
{
	while (min(A - a, B - b) > 1) {
		cout << ">^" << endl;
		a++; b++;
		T--;
	}
	while (max(A - a, B - b) > 1) {
		if (A - a <= B - b) {
			cout << ">" << endl;
			b++;
		}
		else {
			cout << "^" << endl;
			a++;
		}
		T--;
	}
}

void wander(int& a, int& b, int A, int B, int& T)
{
	while (T > 1) {
		if (a == A && b == B) {
			cout << "<" << endl;
			b--; T--;
		}
		else if (a == A && b == B - 1) {
			cout << "v" << endl;
			a--; T--;
		}
		else if (a == A - 1 && b == B - 1) {
			cout << ">" << endl;
			b++; T--;
		}
		else {
			cout << "<" << endl;
			b--; T--;
		}
	}
}

void goal(int& a, int& b, int A, int B, int& T)
{
	if (a == A && b == B - 1)
		cout << ">" << endl;
	else if (a == A - 1 && b == B - 1)
		cout << ">^" << endl;
	else
		cout << "^" << endl;
}

int yuki0232()
{
	int T, A, B;
	cin >> T >> A >> B;

	if ((T == 1 && !A && !B) || (T < max(A, B))) {
		cout << "NO" << endl;
		return 0;
	}
	cout << "YES" << endl;

	int a = 0, b = 0;
	approach(a, b, A, B, T);
	wander(a, b, A, B, T);
	goal(a, b, A, B, T);

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0232();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}