#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define DEBUG(x) cout<<#x<<": "<<x<<endl

using namespace std;

typedef pair<int,int> P;
typedef long long int LL;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t,a,b;
	cin>>t>>a>>b;
	int tmp=b;
	b=a;
	a=tmp;
	vector<char> ansx(t,' ');
	vector<char> ansy(t,' ');
	if(a>t||b>t){
		cout<<"NO"<<endl;
		return 0;
	}else{
		int px=0,py=t-1;
		for(;px<a;px++){
			ansx[px]='>';
		}
		REP(i,b){
			ansy[py]='^';
			py--;
		}
		if(px==py){
			if(px+2<=t){
				ansx[px++]='<';
				ansx[px++]='>';
				
			}
			if(py+2<=t){
				ansy[py++]='v';
				ansy[py++]='^';
			}
			if(px<=py){
				cout<<"NO"<<endl;
				return 0;
			}
		}else if(px<py){
			int m=py-px+1;
			while(px<=py){
				ansx[px]='>';
				px++;
				ansx[px]='<';
				px++;
				ansy[py]='^';
				py--;
				ansy[py]='v';
				py--;
			}
		}
	}
	cout<<"YES"<<endl;
	REP(i,t){
		if(ansx[i]==' '){
			cout<<ansy[i]<<endl;
		}else if(ansy[i]==' '){
			cout<<ansx[i]<<endl;
		}else{
			cout<<ansx[i]<<ansy[i]<<endl;
		}
	}
	return 0;
}