#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int t,a,b;
	cin >> t >> a >> b;
	if(t < max(a,b) || (t == 1 && a == 0 && b == 0)){
		cout << "NO" << endl;
	}else{
		int nx = 0,ny = 0;
		cout << "YES" << endl;
		if(t - max(a,b) == 1){
			if(a == b){
				for(int i = 0;i < max(a,b) - 1;i++){
					cout << ">^" << endl;
				}
				cout << ">" << endl << "^" << endl;
			}else{
				for(int i = 0;i < min(a,b);i++){
					cout << ">^" << endl;
				}
				int m = min(a,b);
				a -= m;
				b -= m;
				if(a == 0){
					cout << ">^" << endl << "v" << endl;
					for(int i = 0;i < b - 1;i++){
						cout << ">" << endl;
					}
				}else{
					cout << ">^" << endl << "<" << endl;
					for(int i = 0;i < a - 1;i++){
						cout << "^" << endl;
					}
				}
			}
		}else{
			for(int i = 0;i < min(a,b);i++){
				cout << ">^" << endl;
				t--;
			}
			int m = min(a,b);
			a -= m;
			b -= m;
			if(a == 0){
				for(int i = 0;i < b;i++){
					cout << ">" << endl;
					t--;
				}
			}else{
				for(int i = 0;i < a;i++){
					cout << "^" << endl;
					t--;
				}
			}
			while(t){
				if(t % 2 == 1){
					t -= 3;
					cout << ">^" << endl << "<" << endl << "v" << endl;
				}else if(t % 2 == 0){
					t -= 2;
					cout << ">" << endl << "<" << endl;
				}
			}
		}
	}
	return 0;
}