#include<bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
char s[1003][1003];
void solve(int u,int d,int l,int r)
{
	if(u>d||l>r) return ;
	for(int i=u; i<d; ++i) s[i][l]='^';
	for(int i=l+1; i<=r; ++i) s[u][i]='>';
	for(int i=u+1; i<=d; ++i) s[i][r]='v';
	for(int i=l; i<r; ++i) s[d][i]='<';
	if(d-u==2||r-l==2) return ;
	++u,--d,++l,--r;
	for(int i=u+1; i<d; i+=2) s[i][l]='>',s[i][r]='<';
	for(int i=u+2; i<d; i+=2) s[i][l+1]='<',s[i][r-1]='>';
	for(int i=l+1; i<r; i+=2) s[u][i]='v',s[d][i]='^';
	for(int i=l+2; i<r; i+=2) s[u+1][i]='^',s[d-1][i]='v';
	solve(u+2,d-2,l+2,r-2);
}
signed main()
{
	memset(s,'.',sizeof(s));
	int n=read(),m=read();
	int line=n*m*2+n+m;
	// if(line%3!=0) puts("No"),exit(0);
	if(n%6==3&&n==m)
	{
		solve(1,n,1,m);
		puts("Yes");
		for(int i=1; i<=n; ++i,puts(""))
			for(int j=1; j<=m; ++j)
				printf("%c",s[i][j]);
	}
	else puts("No");
	return 0;
}