#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <functional>
#include <queue>
#include <set>

using namespace std;

#define For(i,a,b) for(int i = (a);i < (b);i++)
#define rep(i,n) For(i,0,n)

const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
string dc[8] = { ">", "v", "<", "^", ">^", ">v", "<^", "<v" };

typedef pair<int, int> P;

int main(){

	int t, a, b;
	cin >> t >> a >> b;

	if (a == 0 && b == 0){
		if (t > 1){
			cout << "YES" << endl;
			if (t % 2){
				cout << "<v" << endl;
				cout << ">" << endl;
				cout << "^" << endl; t -= 3;
			}
			rep(i, t/2){
				cout << "v" << endl;
				cout << "^" << endl;
			}
			return 0;
		}
	}

	//取りあえず最短時間を出す
	int m = max(a, b);

	//最短時間が制限時間より長い場合は無理
	if (t < m){
		cout << "NO" << endl;
	}
	else{

		rep(k, 3){
			if (k == 1){
				a++; t--; m = max(a, b);
			}
			if (k == 2){
				a--; b++; m = max(a, b);
			}

			if (t <= 2 && (t - m) % 2){
				continue;
			}

			cout << "YES" << endl;
			if (k == 1){
				cout << "v" << endl;
			}
			if (k == 2){
				cout << "<" << endl;
			}

			if (t > 2 && (t - m) % 2){
				cout << ">" << endl;
				cout << "^" << endl;
				t -= 2; a--; b--; m--;
			}
			rep(i, min(a, b)){
				cout << "^>" << endl;
			}
			rep(i, m - min(a, b)){
				if (a > b)cout << "^" << endl;
				else      cout << ">" << endl;
			}

			if (t - m){
				rep(i, (t - m) / 2){
					cout << ">" << endl;
					cout << "<" << endl;
				}
			}
			return 0;
		}
		cout << "NO" << endl; return 0;
	}





	return 0;
}