// BCC
/*
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include <queue>
*/

// GCC
#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define each(i, c) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define chmin(a, b) a = min(a, b)
#define chmax(a, b) a = max(a, b)
#define pb push_back
#define mp make_pair

typedef long long ll;

const int INF = 1 << 28;
const ll INFLL = 1ll << 56;

const char *C = "^>v<";


int main()
{
	int t, a, b;
	scanf("%d %d %d", &t, &a, &b);
	
	if (max(a, b) > t){
		puts("NO");
		return 0;
	}
	
	if (t + a + b == 1){
		puts("NO");
		return 0;
	}
	
	puts("YES");
	
	// 1: up, 2: right, 4: down, 8: left
	vector<int> res;
	rep(i, (t - max(a, b)) / 2){
		res.pb(1);
		res.pb(4);
	}
	rep(i, max(a, b)){
		int x = 0;
		if (i < a) x += 1;
		if (i < b) x += 2;
		res.pb(x);
	}
	if ((t - max(a, b)) & 1){
		int x = res.back(); res.pop_back();
		if (x == 3){
			res.pb(1);
			res.pb(2);
		}
		else if (x == 1){
			res.pb(3);
			res.pb(8);
		}
		else if (x == 2){
			res.pb(3);
			res.pb(4);
		}
		else if (x == 4){
			res.pb(12);
			res.pb(2);
		}
	}
	
	for (auto x : res){
		rep(i, 4){
			if (x & (1 << i)){
				printf("%c", C[i]);
			}
		}
		puts("");
	}
}