#include <bits/stdc++.h>
using namespace std;
const int N=1100;
char a[N][N];
void worka(int x,int y){
	                                a[x+0][y+0]='^';
	                a[x+1][y-1]='<',a[x+1][y+0]='<',a[x+1][y+1]='^';
	a[x+2][y-2]='<',a[x+2][y-1]='v',a[x+2][y+0]='.',a[x+2][y+1]='^',a[x+2][y+2]='>';
	                a[x+3][y-1]='v',a[x+3][y+0]='>',a[x+3][y+1]='>';
	                                a[x+4][y+0]='v';
}
void workb(int x,int y){
	                                a[x+0][y+0]='^';
	                a[x+1][y-1]='<',a[x+1][y+0]='^',a[x+1][y+1]='>';
	a[x+2][y-2]='<',a[x+2][y-1]='v',a[x+2][y+0]='>';
	                a[x+3][y-1]='v';
}
void solve(int n,int m,int x,int y){
	if(n==0||m==0)
		return ;
	if(n==3&&m==3){
		a[x+0][y+0]='<',a[x+0][y+1]='<',a[x+0][y+2]='^';
		a[x+1][y+0]='v',a[x+1][y+1]='.',a[x+1][y+2]='^';
		a[x+2][y+0]='v',a[x+2][y+1]='>',a[x+2][y+2]='>';
		return ;
	}
	if(n==5&&m==5){
		a[x+0][y+0]='<',a[x+0][y+1]='<',a[x+0][y+2]='<',a[x+0][y+3]='<',a[x+0][y+4]='^';
		a[x+1][y+0]='v',a[x+1][y+1]='.',a[x+1][y+2]='v',a[x+1][y+3]='.',a[x+1][y+4]='^';
		a[x+2][y+0]='v',a[x+2][y+1]='>',a[x+2][y+2]='.',a[x+2][y+3]='<',a[x+2][y+4]='^';
		a[x+3][y+0]='v',a[x+3][y+1]='.',a[x+3][y+2]='^',a[x+3][y+3]='.',a[x+3][y+4]='^';
		a[x+4][y+0]='v',a[x+4][y+1]='>',a[x+4][y+2]='>',a[x+4][y+3]='>',a[x+4][y+4]='>';
		return ;
	}
	for(int i=0;i<m-1;i+=1) a[x][y+i]='<';
	for(int i=0;i<n-1;i+=1) a[x+i][y+m-1]='^';
	for(int i=1;i<m-0;i+=1) a[x+n-1][y+i]='>';
	for(int i=1;i<n-0;i+=1) a[x+i][y]='v';
	for(int i=2;i<m-2;i+=2) a[x+1][y+i]='v';
	for(int i=2;i<n-2;i+=2) a[x+i][y+m-2]='<';
	for(int i=2;i<m-2;i+=2) a[x+n-2][y+i]='^';
	for(int i=2;i<n-2;i+=2) a[x+i][y+1]='>';
	if(n==9){
		for(int i=3;i<m-4;i+=6) a[x+2][y+i+0]='<',a[x+2][y+i+1]='v',a[x+3][y+i+1]='v',a[x+2][y+i+2]='>';
		for(int i=3;i<m-4;i+=6) a[x+6][y+i+0]='<',a[x+6][y+i+1]='^',a[x+5][y+i+1]='^',a[x+6][y+i+2]='>';
		a[x+3][y+2]='^',a[x+4][y+2]='>',a[x+4][y+3]='>',a[x+5][y+2]='v';
		a[x+3][y+m-3]='^',a[x+4][y+m-3]='<',a[x+4][y+m-4]='<',a[x+5][y+m-3]='v';
		for(int i=7;i<m-7;i+=6)
			worka(x+2,y+i);
		return ;
	}
	if(n==11){
		for(int i=3;i<m-6;i+=6) a[x+2][y+i+0]='<',a[x+2][y+i+1]='v',a[x+3][y+i+1]='v',a[x+2][y+i+2]='>';
		for(int i=5;i<m-4;i+=6) a[x+8][y+i+0]='<',a[x+8][y+i+1]='^',a[x+7][y+i+1]='^',a[x+8][y+i+2]='>';
		a[x+3][y+2]='^',a[x+4][y+2]='>',a[x+4][y+3]='>',a[x+5][y+2]='v';
		a[x+5][y+m-3]='^',a[x+6][y+m-3]='<',a[x+6][y+m-4]='<',a[x+7][y+m-3]='v';
		for(int i=7;i<m-9;i+=6)
			worka(x+2,y+i);
		workb(x+2,y+m-4);
		for(int i=4;i<m-6;i+=6)
			workb(x+5,y+i);
		return ;
	}
	for(int i=3;i<n-3;i+=2) a[x+2][y+i]='^';
	for(int i=3;i<n-3;i+=2) a[x+i][y+m-3]='>';
	for(int i=3;i<m-3;i+=2) a[x+n-3][y+i]='v';
	for(int i=3;i<n-3;i+=2) a[x+i][y+2]='<';
	solve(n-6,m-6,x+3,y+3);
}
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	if(n==2&&m==2){
		puts("Yes");
		puts("<^");
		puts("v>");
		return 0;
	}
	bool ok=0;
	if(n>m){
		swap(n,m);
		ok=1;
	}
	if((n&1)==0||(m&1)==0||n%6!=m%6||n%6==1||(n==3&&m>6)||(n==5&&m>6)){
		puts("No");
		return 0;
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			a[i][j]='.';
	solve(n,m,1,1);
	puts("Yes");
	if(ok==0)
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++)
				putchar(a[i][j]);
			putchar('\n');
		}
	else 
		for(int i=1;i<=m;i++){
			for(int j=1;j<=n;j++)
				putchar(a[j][i]);
			putchar('\n');
		}
	return 0;
}