#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define sz(a) ((int)a.size())
#define all(a) a.begin(),a.end()
#define pb push_back

const int N=1005;
char res[N][N];

void solve2(int x, int y, vector<string> a){
    for(int i=0; i<sz(a); ++i){
        for(int j=0; j<sz(a[i]); ++j) res[x+i][y+j]=a[i][j];
    }
}

void solve(int n, int s){
    if(n==3){
        solve2(s,s,{"<<^","v.^","v>>"});
        return;
    }
    if(n==5){
        solve2(s,s,{"<<<<^","v.v.^","v>.<^","v.^.^","v>>>>"});
        return;
    }
    for(int i=0; i<n-1; ++i){
        res[s][s+i]='<';
        res[s+i][s+n-1]='^';
        res[s+n-1][s+n-1-i]='>';
        res[s+n-1-i][s]='v';
    }
    for(int i=2; i<n-2; i+=2){
        res[s+1][s+i]='v';
        res[s+n-2][s+i]='^';
        res[s+i][s+1]='>';
        res[s+i][s+n-2]='<';
        if(i+1<n-2){
            res[s+2][s+i+1]='^';
            res[s+n-3][s+i+1]='v';
            res[s+i+1][s+2]='<';
            res[s+i+1][s+n-3]='>';
        }
    }
    solve(n-6,s+3);
}

void ahcorz(){
    int n,m;
    cin >> n >> m;
    if(n!=m){
        cout << "No\n";
        return;
    }
    if(n==2){
        cout << "Yes\n";
        cout << "<^\n";
        cout << "v>\n";
        return;
    }
    if(n%3==1||n%2==0){
        cout << "No\n";
        return;
    }
    for(int i=0; i<n; ++i) for(int j=0; j<n; ++j) res[i][j]='.';
    solve(n,0);
    cout << "Yes\n";
    for(int i=0; i<n; ++i){
        for(int j=0; j<n; ++j) cout << res[i][j];
        cout << "\n";
    }
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t=1; //cin >> t;
    while(t--) ahcorz();
}