package yukicoder; import java.util.Scanner; public class Main{ public static void main(String[] args)throws Exception{ new Main().solve(); } void solve(){ Scanner sc=new Scanner(System.in); int t=sc.nextInt(); int a=sc.nextInt(); int b=sc.nextInt(); String[] ans=new String[t]; if(a==0&&b==0){ ans[t-1]="v"; a++;t--; } while(a>0&&b>0){ if(a==1&&b==1)last(a,b,t,ans); if(t<=0){System.out.println("NO");return;} ans[t-1]="^>"; a--;b--;t--; } while(a>0){ if(a==1&&b==0)last(a,b,t,ans); if(t<=0){System.out.println("NO");return;} ans[t-1]="^"; a--;t--; } while(a<0){ if(a==-1&&b==0)last(a,b,t,ans); if(t<=0){System.out.println("NO");return;} ans[t-1]="v"; a++;t--; } while(b>0){ if(b==1&&a==0)last(a,b,t,ans); if(t<=0){System.out.println("NO");return;} ans[t-1]=">"; b--;t--; } while(b<0){ if(b==-1&&a==0)last(a,b,t,ans); if(t<=0){System.out.println("NO");return;} ans[t-1]="<"; b++;t--; } } boolean safe(int a,int b){ int[] x={1,0,1}; int[] y={1,1,0}; for(int i=0;i<3;i++){ if(x[i]==a&&y[i]==b)return true; } return false; } void last(int a,int b,int t,String[] ans){ if(t==2&&(a==-1||b==-1)){ System.out.println("NO"); System.exit(0); }else if(t<=0){ System.out.println("NO"); System.exit(0); }else{ //a↑ b→ if(b==-1){ a++; ans[t-1]="v"; t--; }else if(a==-1){ ans[t-1]="<"; b++; t--; } int[] da={1,1,0,-1,0}; int[] db={1,0,1,0,-1}; String[] ds={"^>","^",">","v","<"}; while(t>=2){ for(int i=0;i<5;i++){ int na=a-da[i]; int nb=b-db[i]; if(safe(na, nb)){ // System.out.println(na+" "+nb+" "+ds[i]); a=na; b=nb; ans[t-1]=ds[i]; t--; break; } } } for(int i=0;i<5;i++){ int na=a-da[i]; int nb=b-db[i]; if(na==0&&nb==0){ a=na; b=nb; ans[t-1]=ds[i]; t--; break; } } System.out.println("YES"); for(int i=ans.length-1;i>=0;i--)System.out.println(ans[i]); System.exit(0); } } }