#include <bits/stdc++.h>
using namespace std;
const int maxn=1e3+10;

int n,m;

char a[maxn][maxn];

void solve(int x,int y,int k){
	if(k==3){
		a[x][y]='<';a[x][y+1]='<';a[x][y+2]='^';
		a[x+1][y]='v';a[x+1][y+1]='.';a[x+1][y+2]='^';
		a[x+2][y]='v';a[x+2][y+1]='>';a[x+2][y+2]='>';
		return;
	}
	if(k==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+1<k;i++){
		a[x+i][y]='^';
		a[x+i+1][y+k-1]='v';
		a[x][y+i+1]='>';
		a[x+k-1][y+i]='<';
	}
	x++;y++;k-=2;
	for(int i=0;i+1<k;i++){
		if(i%2){
			a[x+i][y]='>';
			a[x+i+1][y+k-1]='.';
			a[x][y+i+1]='.';
			a[x+k-1][y+i]='^';
		}
		else{
			a[x+i][y]='.';
			a[x+i+1][y+k-1]='<';
			a[x][y+i+1]='v';
			a[x+k-1][y+i]='.';
		}
	}
	x++;y++;k-=2;
	for(int i=0;i+1<k;i++){
		if(i%2){
			a[x+i][y]='<';
			a[x+i+1][y+k-1]='.';
			a[x][y+i+1]='.';
			a[x+k-1][y+i]='v';
		}
		else{
			a[x+i][y]='.';
			a[x+i+1][y+k-1]='>';
			a[x][y+i+1]='^';
			a[x+k-1][y+i]='.';
		}
	}
	x++;y++;k-=2;
	solve(x,y,k);
}

int main(){
	ios::sync_with_stdio(0);
	cin>>n>>m;
	if(n==2&&m==2){
		cout<<"Yes"<<endl;
		cout<<"<^\nv>"<<endl;
		return 0;
	}
	if((2*n*m+n+m)%3!=0||n!=m||n%2==0){
		cout<<"No"<<endl;
		return 0;
	}
	solve(1,1,n);
	cout<<"Yes"<<endl;
	for(int i=1;i<=n;i++,cout<<endl)
		for(int j=1;j<=n;j++)
			cout<<a[i][j];
	
	
	return 0;
}