#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <string>
#include <climits>
using namespace std;

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,x,n) for(int i=x;i<n;i++)
#define ALL(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<":"<<x<<endl
const int INF = INT_MAX / 3;

int main(){
	int T, A, B;
	cin >> T >> A >> B;
	if (T < max(A, B)){
		cout << "NO" << endl;
		return 0;
	}
	if (T == 1 && A == 0 && B == 0){
		cout << "NO" << endl;
		return 0;
	}
	cout << "YES" << endl;
	int res = T - max(A, B);
	if (res % 2 == 1){
		if (A == 0){
			cout << ">^" << endl << "v" << endl;
			B--;
			T--;
		} else if (B == 0){
			cout << ">^" << endl << "<" << endl;
			A--;
			T--;
		} else{
			cout << ">" << endl << "^" << endl;
			A--; B--;
			T--; T--;
		}
	}
	for (int i = 0; i < min(A, B); i++){
		cout << ">^" << endl;
	}
	for (int i = min(A, B); i < T; i++){
		if (i < max(A, B)){
			if (A>B) cout << "^" << endl;
			else cout << ">" << endl;
		} else{
			if (i % 2) cout << "^" << endl;
			else cout << "v" << endl;
		}
	}
	return 0;
}