#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<string> solve(int M, int N) {
  if (M != N) return {};
  if (!(N % 6 == 3 || N % 6 == 5)) return {};
  vector<string> ans(N, string(N, '.'));
  for (int n = N, off = 0; n > 1; n -= 2, off += 1) {
    auto go = [&](int h, int i, int x, int y) -> void {
      char &a = ans[off + x][off + y];
      if (off % 3 == 0) {
        a = "v>^<"[h];
      } else if (off % 3 == 1) {
        if (i % 2 != 0) a = ">^<v"[h];
      } else if (off % 3 == 2) {
        if (i % 2 != 0) a = "<v>^"[h];
      } else {
        assert(false);
      }
    };
    for (int i = 1; i < n; ++i) go(0, i, i, 0);
    for (int i = 1; i < n; ++i) go(1, i, n - 1, i);
    for (int i = 1; i < n; ++i) go(2, i, n - 1 - i, n - 1);
    for (int i = 1; i < n; ++i) go(3, i, 0, n - 1 - i);
  }
  return ans;
}

int main() {
  int M, N;
  for (; ~scanf("%d%d", &M, &N); ) {
    const auto ans = solve(M, N);
    if (ans.size()) {
      puts("Yes");
      for (int x = 0; x < M; ++x) {
        puts(ans[x].c_str());
      }
    } else {
      puts("No");
    }
  }
  return 0;
}