#include #define REP(i, x, n) for(int i = x; i < (int)(n); i++) #define rep(i, n) REP(i, 0, n) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define F first #define S second #define mp make_pair using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair P; int main() { int t, a, b; cin >> t >> a >> b; if(min(a, b) + abs(a - b) > t) { cout << "NO" << endl; } else { int v = t - min(a, b) - abs(a - b); if(v == 1) { cout << "NO" << endl; } else { cout << "YES" << endl; rep(i, min(a, b) - 1) { cout << "^>" << endl; } if(min(a, b) != 0) { if(v % 2) { cout << "^" << endl; cout << ">" << endl; v--; } else { cout << "^>" << endl; } } rep(i, abs(a - b)) { if(a > b) cout << "^" << endl; else cout << ">" << endl; } if(v % 2) { cout << "" << endl; cout << "^" << endl; v -= 3; } rep(i, v) { if(i % 2) cout << "<" << endl; else cout << ">" << endl; } } } return 0; }