#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()



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

	if (T < max(A, B)) {
		cout << "NO" << endl;
		return 0;
	}
	cout << "YES" << endl;

	bool d; // 軸からの距離 (0 or 1)
	string s[2]; // 軸からの距離が (0 or 1) の時に (s[0] or s[1]) を出力

	if (A == 0 && B == 0) return 0;
	if (A == 0) {
		REP(i, B - 1) cout << ">" << endl;
		d = 0; s[0] = "v"; s[1] = "^";
	}
	else if (B == 0) {
		REP(i, A - 1) cout << "^" << endl;
		d = 0; s[0] = "<"; s[1] = ">";
	}
	else if (A <= B) {
		FOR(i, 0, A - 1) cout << ">^" << endl;
		FOR(i, A - 1, B - 1) cout << ">" << endl;
		d = 1; s[0] = "v"; s[1] = "^";
	}
	else {
		FOR(i, 0, B - 1) cout << ">^" << endl;
		FOR(i, B - 1, A - 1) cout << "^" << endl;
		d = 1; s[0] = "v"; s[1] = "^";
	}

	T -= max(A - 1, B - 1);

	while (T > 1) {
		cout << (d ? s[1] : s[0]) << endl;
		d = !d;
		T--;
	}

	cout << (B == 0 ? (d ? ">^" : "^") : (d ? ">^" : ">")) << endl;

	return 0;
}

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

	yuki0232();

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

	return 0;
}