#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={-1,0,1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n,h,w;cin >> n >> h >> w; if(h==w&&h==0&&n==1){ cout << "NO" < ans; ll p=min(h,w); rep(i,p)ans.push_back(">^"); rep(i,h-p)ans.push_back("^"); rep(i,w-p)ans.push_back(">"); if(n-ans.size()!=1){ ll rem=n-ans.size(); if(rem%2){ rem-=3; ans.push_back("^"); ans.push_back("v>"); ans.push_back("<"); } rep(i,rem/2){ ans.push_back("<"); ans.push_back(">"); } rep(i,n)cout << ans[i] <^"){ ans[0]="^";ans.push_back(">"); } else if(ans[0]=="^"){ ans.pop_back(); ans.push_back(">"); ans.push_back("^<"); } else { ans.pop_back(); ans.push_back("^"); ans.push_back("v>"); } rep(i,n)cout << ans[i] <