/**
 * date   : 2024-12-15 17:57:38
 * author : Nyaan
 */

#define NDEBUG

using namespace std;

// intrinstic
#include <immintrin.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tr2/dynamic_bitset>
#include <tuple>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

// utility

namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  constexpr P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  template <typename S>
  P &operator*=(const S &r) {
    first *= r, second *= r;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
  template <typename S>
  P operator*(const S &r) const {
    return P(*this) *= r;
  }
  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

vector<int> mkiota(int n) {
  vector<int> ret(n);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
T mkrev(const T &v) {
  T w{v};
  reverse(begin(w), end(w));
  return w;
}

template <typename T>
bool nxp(T &v) {
  return next_permutation(begin(v), end(v));
}

// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
  vector<vector<T>> ret;
  vector<T> v;
  auto dfs = [&](auto rc, int i) -> void {
    if (i == (int)a.size()) {
      ret.push_back(v);
      return;
    }
    for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
  };
  dfs(dfs, 0);
  return ret;
}

// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
  T res = I;
  for (; n; f(a = a * a), n >>= 1) {
    if (n & 1) f(res = res * a);
  }
  return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I = T{1}) {
  return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}

template <typename T>
T Rev(const T &v) {
  T res = v;
  reverse(begin(res), end(res));
  return res;
}

template <typename T>
vector<T> Transpose(const vector<T> &v) {
  using U = typename T::value_type;
  if(v.empty()) return {};
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      res[j][i] = v[i][j];
    }
  }
  return res;
}

template <typename T>
vector<T> Rotate(const vector<T> &v, int clockwise = true) {
  using U = typename T::value_type;
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      if (clockwise) {
        res[W - 1 - j][i] = v[i][j];
      } else {
        res[j][H - 1 - i] = v[i][j];
      }
    }
  }
  return res;
}

}  // namespace Nyaan


// bit operation

namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return __builtin_popcountll(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan


// inout

namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}

istream &operator>>(istream &is, __int128_t &x) {
  string S;
  is >> S;
  x = 0;
  int flag = 0;
  for (auto &c : S) {
    if (c == '-') {
      flag = true;
      continue;
    }
    x *= 10;
    x += c - '0';
  }
  if (flag) x = -x;
  return is;
}

istream &operator>>(istream &is, __uint128_t &x) {
  string S;
  is >> S;
  x = 0;
  for (auto &c : S) {
    x *= 10;
    x += c - '0';
  }
  return is;
}

ostream &operator<<(ostream &os, __int128_t x) {
  if (x == 0) return os << 0;
  if (x < 0) os << '-', x = -x;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
  if (x == 0) return os << 0;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan


// debug


#ifdef NyaanDebug
#define trc(...) (void(0))
#endif
#ifndef NyaanDebug
#define trc(...) (void(0))
#endif

#ifndef NyaanLocal
#define trc2(...) (void(0))
#endif


// macro

#define each(x, v) for (auto&& x : v)
#define each2(x, y, v) for (auto&& [x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b)-1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)


namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }


//



using namespace std;

// https://github.com/not522/CompetitiveProgramming/blob/master/old2/include/math/sat.hpp
class SatSolver {
 private:
  int n, qi;
  vector<vector<pair<int, bool>>> cl;
  vector<vector<int>> w[2];
  vector<int> reason, level, que, activity;

  void enqueue(int v, bool a, int r = -1) {
    assigns[v] = a;
    reason[v] = r;
    level[v] = (que.empty() ? 1 : level[que.back()]);
    que.emplace_back(v);
  }

  void add(const vector<pair<int, bool>> &clause) {
    for (auto l : clause) w[l.second][l.first].emplace_back(cl.size());
    cl.emplace_back(clause);
  }

  void analyze(int confl) {
    int i = que.size(), lv = 1;
    unordered_set<int> used;
    vector<pair<int, bool>> learnt;
    for (int cnt = 0; cnt || used.empty(); --cnt) {
      for (auto q : cl[confl]) {
        if (!used.emplace(q.first).second) continue;
        activity[q.first] += 1e5;
        if (level[q.first] == level[que.back()]) {
          ++cnt;
        } else {
          learnt.emplace_back(q);
          lv = max(lv, level[q.first]);
        }
      }
      while (!used.count(que[--i]))
        ;
      confl = reason[que[i]];
    }
    learnt.emplace_back(que[i], !assigns[que[i]]);
    for (; !que.empty() && level[que.back()] > lv; que.pop_back()) {
      level[que.back()] = 0;
    }
    qi = que.size();
    enqueue(learnt.back().first, learnt.back().second, cl.size());
    add(learnt);
  }

  int propagate() {
    for (; qi < int(que.size()); ++qi) {
      for (int cr : w[!assigns[que[qi]]][que[qi]]) {
        int cnt = 0;
        for (auto &lit : cl[cr]) {
          if (level[lit.first] == 0) {
            activity[lit.first] += 1e3;
            swap(lit, cl[cr][0]);
            ++cnt;
          } else if (assigns[lit.first] == lit.second) {
            swap(lit, cl[cr][0]);
            cnt = -1;
            break;
          }
        }
        if (cnt == 0) return cr;
        if (cnt == 1) enqueue(cl[cr][0].first, cl[cr][0].second, cr);
      }
    }
    return -1;
  }

 public:
  vector<bool> assigns;

  SatSolver(int _n)
      : n(_n), qi(0), reason(n), level(n), activity(n), assigns(n) {
    w[0].resize(n), w[1].resize(n);
  }

  void add_clause(const vector<pair<int, bool>> &clause) { add(clause); }

  void if_then(int v1, bool a1, int v2, bool a2) {
    add(vector{make_pair(v1, !a1), make_pair(v2, a2)});
  }
  void set_val(int v, bool a) { add(vector{make_pair(v, a)}); }

  bool solve() {
    while (true) {
      int confl = propagate();
      if (confl != -1) {
        if (level[que.back()] == 1u) return false;
        for (auto &a : activity) a /= 1.05;
        analyze(confl);
      } else {
        int k = -1;
        for (int i = 0; i < n; ++i) {
          if (level[i] == 0 && (k == -1 || activity[k] < activity[i])) k = i;
        }
        if (k == -1) return true;
        enqueue(k, assigns[k]);
        ++level[k];
      }
    }
  }
};


using namespace Nyaan;

V<string> naive(ll H, ll W) {
  ll x = H * (W + 1) + W * (H + 1);
  if (x % 3 != 0) return {};
  x /= 3;

  V<string> ans(H, string(W, '.'));
  int num = 0, rest = H * W;

  int finish = 0;
  auto dfs = [&](auto rc, int h, int w) {
    if (w == W) w = 0, h++;
    if (h == H) {
      if (num == x) finish = 1;
      return;
    }
    if (num + rest < x) return;
    for (char c : ".^v<>"s) {
      if (w > 0 and ans[h][w - 1] != '.' and ans[h][w - 1] != '<' and
          c != '>' and c != '.')
        continue;
      if (h > 0 and ans[h - 1][w] != '.' and ans[h - 1][w] != '^' and
          c != 'v' and c != '.')
        continue;

      ans[h][w] = c;
      num += c != '.';
      rest--;

      rc(rc, h, w + 1);
      if (finish) return;

      num -= c != '.';
      rest++;
    }
  };
  dfs(dfs, 0, 0);

  if (finish) return ans;
  return {};
}

V<string> naive2(ll H, ll W) {
  {
    ll x = H * (W + 1) + W * (H + 1);
    if (x % 3 != 0) return {};
  }
  string X = ".^v<>";
  auto idx = [&](int h, int w, int x) { return h * W * 5 + w * 5 + x; };

  SatSolver sat(H * W * 5);

  rep(i, H) rep(j, W) {
    // 全マス何らかの役割
    {
      V<pair<int, bool>> clause;
      rep(k, 5) clause.emplace_back(idx(i, j, k), 1);
      sat.add_clause(clause);
    }
    // かつ両方 true とかはだめ
    rep(k, 5) rep(l, k) {
      V<pair<int, bool>> clause;
      clause.emplace_back(idx(i, j, k), false);
      clause.emplace_back(idx(i, j, l), false);
      sat.add_clause(clause);
    }
  }
  // 縦の辺 true が必要
  rep(i, H) rep(j, W + 1) {
    V<pair<int, bool>> clause;
    if (j != 0) {
      rep(k, 5) if (X[k] != '.' and X[k] != '<') {
        clause.emplace_back(idx(i, j - 1, k), true);
      }
    }
    if (j != W) {
      rep(k, 5) if (X[k] != '.' and X[k] != '>') {
        clause.emplace_back(idx(i, j, k), true);
      }
    }
    sat.add_clause(clause);
    rep(k, sz(clause)) rep(l, k) {
      V<pair<int, bool>> c2;
      c2.emplace_back(clause[k].fi, 0);
      c2.emplace_back(clause[l].fi, 0);
      sat.add_clause(c2);
    }
  }
  // 横の辺 true が必要
  rep(i, H + 1) rep(j, W) {
    V<pair<int, bool>> clause;
    if (i != 0) {
      rep(k, 5) if (X[k] != '.' and X[k] != '^') {
        clause.emplace_back(idx(i - 1, j, k), true);
      }
    }
    if (i != H) {
      rep(k, 5) if (X[k] != '.' and X[k] != 'v') {
        clause.emplace_back(idx(i, j, k), true);
      }
    }
    sat.add_clause(clause);
    rep(k, sz(clause)) rep(l, k) {
      V<pair<int, bool>> c2;
      c2.emplace_back(clause[k].fi, 0);
      c2.emplace_back(clause[l].fi, 0);
      sat.add_clause(c2);
    }
  }

  auto flag = sat.solve();
  if (!flag) return {};

  V<string> ans(H, string(W, '#'));
  rep(i, H) rep(j, W) rep(k, 5) {
    if (sat.assigns[idx(i, j, k)]) ans[i][j] = X[k];
  }
  return ans;
}

V<string> calc(ll H, ll W) {
  {
    ll x = H * (W + 1) + W * (H + 1);
    if (x % 3 != 0) return {};
  }
  if (H == 2 and W == 2) return naive2(H, W);
  if (H == 3 and W == 3) return naive2(H, W);
  if (H == 5 and W == 5) return naive2(H, W);
  if (H < 9 or W < 9) return {};
  if (H % 6 != W % 6) return {};
  if (H % 6 != 3 and H % 6 != 5) return {};

  if (H == 9) {
    V<string> ans = {
        "<<<<<<<<^", "v.v.v.v.^", "v>.^.^.<^", "v.<^>>>.^", "v>.^.v.<^",
        "v.<<<v>.^", "v>.v.v.<^", "v.^.^.^.^", "v>>>>>>>>",
    };
    V<string> bns = {"<<<<<<", ".v.v.v", "^.^.^.", ">>>>>>", "v.v.v.",
                     ".^.<v>", "<^>.v.", ".^.^.^", ">>>>>>"};

    V<string> cns;
    rep(i, 9) {
      string S;
      S += ans[i].substr(0, 9 - 2);
      rep(_, (W - 9) / 6) S += bns[i];
      S += ans[i].substr(9 - 2, 2);
      cns.push_back(S);
    }
    return cns;
  }

  if (H == 11) {
    vector<string> ans = {
        "<<<<<<<<<<^", "v.v.v.v.v.^", "v>.^.<v>.<^", "v.<<^.v.^.^",
        "v>.v>>.<<<^", "v.^.v.^.v.^", "v>>>.<<^.<^", "v.v.^.v>>.^",
        "v>.<^>.v.<^", "v.^.^.^.^.^", "v>>>>>>>>>>",
    };
    vector<string> bns = {
        "<<<<<<", ".v.v.v", "^.^.^.", ">>>>>>", "v.v.v.", ".^.<v>",
        "<^>.v.", ".^.<v>", "<^>.v.", ".^.^.^", ">>>>>>",
    };
    V<string> cns;
    rep(i, 11) {
      string S;
      S += ans[i].substr(0, 11 - 2);
      rep(_, (W - 11) / 6) S += bns[i];
      S += ans[i].substr(11 - 2, 2);
      cns.push_back(S);
    }
    return cns;
  }

  if (W == 9 or W == 11) {
    auto bns = calc(W, H);
    V<string> ans(H, string(W, '#'));
    rep(i, H) rep(j, W) ans[i][j] = bns[j][i];
    return ans;
  }

  V<string> ans(H, string(W, '.'));

  rep(j, W - 1) ans[0][j] = '<';
  rep(i, H - 1) ans[i][W - 1] = '^';
  rep1(j, W - 1) ans[H - 1][j] = '>';
  rep1(i, H - 1) ans[i][0] = 'v';

  rep(i, H) rep(j, W) {
    if (i == 0 or i == H - 1 or j == 0 or j == W - 1) continue;
    if (i == 2 and j % 2 == 1) ans[i][j] = '^';
    if (i == H - 3 and j % 2 == 1) ans[i][j] = 'v';
    if (j == 2 and i % 2 == 1) ans[i][j] = '<';
    if (j == W - 3 and i % 2 == 1) ans[i][j] = '>';
    if (i == 1 and j % 2 == 0) ans[i][j] = 'v';
    if (i == H - 2 and j % 2 == 0) ans[i][j] = '^';
    if (j == 1 and i % 2 == 0) ans[i][j] = '>';
    if (j == W - 2 and i % 2 == 0) ans[i][j] = '<';
    
  }
  auto bns = calc(H - 6, W - 6);
  rep(i, H - 6) rep(j, W - 6) ans[i + 3][j + 3] = bns[i][j];
  return ans;
}

void q() {
  /*
  rep1(H, 30) {
    trc2(H);
    rep1(W, 30) {
      auto an = naive2(H, W);
      if (sz(an)) {
        out(H, W);
        each(v, an) out(v);
      } else {
        // trc2(H, W, "no answer");
      }
    }
  }
  */

  ini(H, W);
  auto ans = calc(H, W);
  if (ans.empty()) die("No");
  out("Yes");
  each(v, ans) out(v);
}

void Nyaan::solve() {
  int t = 1;
  // in(t);
  while (t--) q();
}