#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define M 1000000007
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int main(void){
	int t,a,b;
	cin>>t>>a>>b;
	if(a==0&&b==0&&t==1)return cout<<"NO"<<endl,0;
	if(t>=max(a,b)){
		cout<<"YES"<<endl;
		int i=0,j=0,k=0;
		if(i==a&&j==b){i++;cout<<"^"<<endl;k++;}
		for(;i<a-1||j<b-1;k++){
				if(i!=a-1){i++;cout<<"^";}
				if(j!=b-1){j++;cout<<">";}
			cout<<endl;
		}
		for(;k<t-1;k++){
			if(i==a-1&&j==b-1){i++;cout<<"^"<<endl;}
			else if(i==a&&j==b-1){i++;cout<<"^"<<endl;}
			else if(i==a+1&&j==b-1){j++;cout<<">"<<endl;}
			else if(i==a+1&&j==b){j++;cout<<">"<<endl;}
			else if(i==a+1&&j==b+1){i--;cout<<"v"<<endl;}
			else if(i==a&&j==b+1){i--;cout<<"v"<<endl;}
			else if(i==a-1&&j==b+1){j--;cout<<"<"<<endl;}
			else if(i==a-1&&j==b){j--;cout<<"<"<<endl;}
		}
		if(i==a-1&&j==b-1){i++;cout<<"^>"<<endl;}
		else if(i==a&&j==b-1){i++;cout<<">"<<endl;}
		else if(i==a+1&&j==b-1){j++;cout<<">v"<<endl;}
		else if(i==a+1&&j==b){j++;cout<<"v"<<endl;}
		else if(i==a+1&&j==b+1){i--;cout<<"v<"<<endl;}
		else if(i==a&&j==b+1){i--;cout<<"<"<<endl;}
		else if(i==a-1&&j==b+1){j--;cout<<"^<"<<endl;}
		else if(i==a-1&&j==b){j--;cout<<"^"<<endl;}

	}else cout<<"NO"<<endl;
	return 0;
}