#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <functional>
#include <sstream>
#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;

	vector<char> ud, rl;

	if (a > t || b > t){
		cout << "NO" << endl; return 0;
	}

	bool fa = false;
	rep(i, a){
		ud.push_back('^');
	}
	int ta = t - a;
	if (ta % 2){
		fa = true;			
		ta--;
	}
	{
		rep(i, ta / 2){
			ud.push_back('^');
			ud.push_back('v');
		}
	}


	bool fb = false;
	rep(i, b){
		rl.push_back('>');
	}
	int tb = t - b;
	if (tb % 2){
		fb = true;
		tb--;
	}
	{
		rep(i, tb / 2){
			rl.push_back('>');
			rl.push_back('<');
		}
	}

	stringstream ss;

	while (t != max(rl.size(), ud.size())){

		if (!rl.size() && !ud.size()){
			cout << "NO" << endl; return 0;
		}

		if (rl.size() && rl.size() < ud.size()){
			ss << rl[rl.size() - 1] << endl;
			rl.pop_back();
		}
		else
		if(ud.size()){
			ss << ud[ud.size() - 1] << endl;
			ud.pop_back();
		}
		t--;
	}

	cout << "YES" << endl;
	
	rep(i, t){
		if (i < rl.size()){
			ss << rl[i];
		}
		if (i < ud.size()){
			ss << ud[i];
		}
		ss << endl;
	}

	cout << ss.str();

	return 0;
}