#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};


int main(){
	int t,a,b;
	int up_mode = -3;
	int right_mode = 0;
	int nowy = 0;
	int nowx = 0;
	string Up[2] = {"^","v"};
	string Right[2] = {">","<"};
	cin >> t >> a >> b;
    
	if(t >= max(a,b) && (a != 0 || b != 0 || t != 1)){
		cout << "YES" << endl;
		
		//上下：(余り1:停止)→移動→足踏み
		//左右：足踏み→移動→(余り1:停止)
		for(int cnt=t; cnt>0; cnt--){
			//上下
			if(up_mode == -2){
				up_mode = -1;
			}
			
			if(up_mode == -3){
				if(cnt - a % 2 == 1){
					up_mode = -2;
				}else{
					up_mode = -1;
				}
			}
			
			if(up_mode == -1){
				if(nowy == a){
					up_mode = 0;
				}else{
					cout << Up[0];
					nowy ++;
				}
			}else if(up_mode == 0 || up_mode == 1){
				cout << Up[up_mode];
				up_mode = 1 - up_mode;
			}
			
			//左右
			if(right_mode == 0 || right_mode == 1){
				if(right_mode == 0 && cnt <= b + 1){
					right_mode = 2;
				}else{
					cout << Right[right_mode];
					right_mode = 1 - right_mode;
				}
			}
			
			if(right_mode == 2){
				if(nowx == b){
					right_mode = 3;
				}else{
					nowx ++;
					cout << Right[0];
				}
			}
			
			cout << endl;
		}	
	}else{
		cout << "NO" << endl;
	}
    return 0;
}