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

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define debug( fmt, ... ) \
        fprintf( stderr, \
                  fmt "\n", \
                  ##__VA_ARGS__ \
        )

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int INF = 1 << 29;
const double EPS = 1e-10;

double zero(double d) {
    return d < EPS ? 0.0 : d;
}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
    os << '[';
    rep(i, a.size()) os << (i ? " " : "") << a[i];
    return os << ']';
}

string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

const int MOD = 1000000007;
// a^k
ll fpow(ll a, ll k, int M) {
    ll res = 1ll;
    ll x = a;
    while (k != 0) {
        if ((k & 1) == 1)
            res = (res * x) % M;
        x = (x * x) % M;
        k >>= 1;
    }
    return res;
}

struct prepare {
	prepare() {
	    cout.setf(ios::fixed, ios::floatfield);
	    cout.precision(8);
	    ios_base::sync_with_stdio(false);
	}
} _prepare;

int main() {
    int T, A, B;
    cin >> T >> A >> B;

    pii pos = mp(0,0);
    vector<string> ans;

    if(T < max(A, B) ||
       (A==0 && B == 0 && T == 1)) {
        cout << "NO" << endl;
        return 0;
    }

    cout << "YES" << endl;
    if(A == 0 && B == 0) {
        T--;
        ans.push_back("<");
        pos = mp(-1, 0);
    }

    int ru = min(A, B);
    int rA = A - ru, rB = B - ru;

    rep(i, ru)
        ans.push_back(">^");
    rep(i, rA)
        ans.push_back("^");
    rep(i, rB)
        ans.push_back(">");
    T -= ru + rA + rB;

    pos.first += ru + rA;
    pos.second += ru + rB;

    // prev
    if(A != 0 || B != 0) {
        string a = ans[ans.size()-1];
        ans.pop_back();
        if(a == ">^")
            pos.first--, pos.second--;
        else if(a == "^")
            pos.first--;
        else
            pos.second--;
        T++;
    }

    vector<string> loop_str = {">", ">", "^", "^", "<", "<", "v", "v"},
            goal = {">^", "^", "<^", "<", "v<", "v", ">v", ">"};
    int now = 0;
    if( (A-pos.first) > 0 ) {
        if( (B-pos.second) > 0)
            now = 0;
        else
            now = 7;
    }
    else
        now = 1;

    rep(i, T-1)
        ans.push_back( loop_str[(now+i) % loop_str.size()] );
    ans.push_back(goal[(now + T-1) % goal.size()]);

    tr(it, ans)
        cout << *it << endl;

    return 0;
}