import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int T, A, B;

void main() {
  try {
    for (; ; ) {
      T = readInt();
      A = readInt();
      B = readInt();
      if (T < max(A, B)) {
        writeln("NO");
      } else if (A == 0 && B == 0) {
        writeln("NO");
      } else {
        string[] seq;
        foreach (_; 0 .. min(A, B)) {
          seq ~= "^>";
        }
        foreach (_; min(A, B) .. A) {
          seq ~= "^";
        }
        foreach (_; min(A, B) .. B) {
          seq ~= ">";
        }
        string[] ans;
        foreach (_; 0 .. (T - max(A, B)) / 2) {
          ans ~= "v";
          ans ~= "^";
        }
        foreach (i, s; seq) {
          if (i == 0 && (T - max(A, B)) % 2 != 0) {
            switch (s) {
              case "^>": ans ~= "^"; ans ~= ">"; break;
              case "^": ans ~= "<"; ans ~= "^>"; break;
              case ">": ans ~= "v"; ans ~= "^>"; break;
              default: assert(false);
            }
          } else {
            ans ~= s;
          }
        }
        writeln("YES");
        foreach (s; ans) {
          writeln(s);
        }
      }
    }
  } catch (EOFException e) {
  }
}