#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

void solve()
{
	int t,a,b;
	cin>>t>>a>>b;
	int x=0,y=0;
	if(a>t||b>t){
		cout<<"NO\n";
		return;
	}
	else if(t==1&&a==0&&b==0){
		cout<<"NO\n";
		return;
	}
	cout<<"YES\n";
	vector<string>com;
	while(x<a&&y<b){
		com.pb("^>");
		++x;++y;
	}
	if(x!=a){
		rep(i,a-x)com.pb("^");
		if(com.size()==t-1){
			com.erase(com.begin()+t-2);
			com.pb(">^");
			com.pb("<");
		}
	}
	else if(y!=b){
		rep(i,b-y)com.pb(">");
		if(com.size()==t-1){
			com.erase(com.begin()+t-2);
			com.pb(">^");
			com.pb("v");
		}
	}
	if(com.size()==t-1){
		com.erase(com.begin()+t-2);
		com.pb("^");
		com.pb(">");
	}
	if((t-(int)com.size())%2==0&&com.size()!=t){
		int sz=com.size();
		rep(i,t-sz){
			if(i%2==0)com.pb(">");
			else com.pb("<");
		}
	}
	else if((t-(int)com.size())%2==1){
		com.pb(">");
		com.pb("v");
		com.pb("^<");
		int sz=com.size();
		rep(i,t-sz){
			if(i%2==0)com.pb(">");
			else com.pb("<");
		}
	}
	rep(i,t){
		cout<<com[i]<<"\n";
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}