#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

int t, a, b;
int y, x; //現在地

int main() {
	cin >> t >> a >> b;
	if (a == 0 && b == 0 && t == 1) {
		cout << "NO" << endl;
		return 0;
	}
	if (max(a, b) > t) {
		cout << "NO" << endl;
		return 0;
	} 
	cout << "YES" << endl;
	int r = t - max(a, b);
	// 無駄な動きが1だけ必要なときは最小に無駄に動く
	if (r == 1) {
		if (min(a, b) > 0) {
			cout << "^" << endl;
			cout << ">" << endl;
			x++; y++;
		} else if (a == 0 && b > 0) {
			cout << "^>" << endl;
			cout << "v" << endl;
			x++;
		} else {
			//a > 0 && b == 0
			cout << "^>" << endl;
			cout << "<" << endl;
			y++;
		}
		t -= 2;
	}
	// ゴールまで行く
	while (a != y || b != x) {
		if (y < a && x < b) {
			cout << "^>" << endl;
			x++; y++;
		} else if (y < a) {
			cout << "^" << endl;
			y++;
		} else {
			// x < b;
			cout << ">" << endl;
			x++;
		}
		t--;
	}
	// 残り無駄な動きでゴール位置で帳尻あわせ
	// tは1以外の値になっている
	while (t > 0) {
		if (t % 2 == 1) {
			cout << ">" << endl;
			cout << "v" << endl;
			cout << "<^" << endl;
			t -= 3;
		} else {
			cout << ">" << endl;
			cout << "<" << endl;
			t -= 2;
		}
	}
	return 0;
}