#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 1111, M = 111111;
int l, m, n, t, C, a[N][N];
void work(int n) {
  for (int _tmp = 2 * n, i = 1; i <= _tmp; ++i)
    for (int _tmp = 2 * n, j = 1; j <= _tmp; ++j) a[i][j] = '.';
  for (int _tmp = n, i = 1; i <= _tmp; ++i)
    if (!(i & 1)) a[1][i] = '<';
  for (int _tmp = n, i = 1; i <= _tmp; ++i) a[1][i + n] = '<';
  for (int _tmp = n - 1, i = 1; i <= _tmp; ++i) a[2][i * 2] = '>';
  for (int _tmp = n, i = 1; i <= _tmp; ++i)
    a[2 * n - 1][i * 2 - 1] = '>', a[2 * n - 1][i * 2] = '^';
  a[1][1] = 'v';
  for (int _tmp = 2 * n - 2, i = 2; i <= _tmp; ++i)
    if (i < n + 2 || (i - n) % 2 == (n & 1))
      for (int _tmp = n, j = 1; j <= _tmp; ++j)
        a[i][j * 2 - 1] = 'v', a[2 * n + 2 - i][j * 2] = '^';
  for (int _tmp = 2 * n, i = 1; i <= _tmp; ++i)
    a[2 * n][i] = a[2 * n - 1][i], a[2 * n - 1][i] = a[2 * n - 3][i];
  for (int _tmp = 2 * n, i = 1; i <= _tmp; ++i) {
    for (int _tmp = 2 * n, j = 1; j <= _tmp; ++j) printf("%c", a[i][j]);
    puts("");
  }
}
int main() {
  scanf("%d%*d", &n);
  if (n == 3) {
    puts(">.v");
    puts(">..");
    puts("^.<");
  } else if (n == 5) {
    puts(">.v.<");
    puts(".....");
    puts("v.<.^");
    puts(".....");
    puts(">.>.^");
  } else
    work(50);
  puts("1 1");
  return 0;
  scanf("%d%*d", &n);
  work(n);
  return 0;
}
