func_code_string: #include <bits/stdc++.h>   using namespace std;   const int inf = 1000000007;   const long long linf = 1LL << 62;   const unsigned long long ulinf = 1ULL << 63;   const double eps = 0.000001;   const double pi = 3.14159265358979323846;   template <class T>   T abs(T a) {     return a >= 0 ? a : -a;   }   template <class T>   T sqr(T a) {     return a * a;   }   template <class T>   T gcd(T a, T b) {     return b ? gcd(b, a % b) : a;   }   template <class T>   T mod(T a, T b) {     return (a % b + b) % b;   }   template <class T>   T addmod(T a, T b, T c) {     return (T)mod((long long)a + b, (long long)c);   }   template <class T>   T mulmod(T a, T b, T c) {     return (T)mod((long long)a * b, (long long)c);   }   template <class T>   T powmod(T a, T b, T c) {     return (T)mod(         b ? mulmod(mod(sqr((long long)powmod(a, b >> 1, c)), (long long)c),                    (b & 1LL) ? a : 1LL, (long long)c)           : 1LL,         (long long)c);   }   template <class T>   void maxe(T &a, T b) {     a = max(a, b);   }   template <class T>   void mine(T &a, T b) {     a = min(a, b);   }   template <class T>   void mode(T &a, T b) {     a = mod(a, b);   }   template <class T>   void addmode(T &a, T b, T c) {     a = addmod(a, b, c);   }   template <class T>   void mulmode(T &a, T b, T c) {     a = mulmod(a, b, c);   }   template <class T>   void powmode(T &a, T b, T c) {     a = powmod(a, b, c);   }   int iszero(double a) { return abs(a) <= eps; }   template <class T>   void geti(T &a) {     a = 0;     int b = 1, c = getchar();     if (c ==  - )       b = -1;     else       a = c - 48;     while ((c = getchar()) !=     && c !=   n ) a = a * 10 + c - 48;     a *= b;   }   void fileio_in_out() {     freopen( .in ,  r , stdin);     freopen( .out ,  w , stdout);   }   void fileio_txt() {     freopen( input.txt ,  r , stdin);     freopen( output.txt ,  w , stdout);   }   const int N = 1111;   int test;   int n, m, k, ans;   char s[N][N];   void work100() {     s[0][0] =  > ;     for (int i = 1; i < 100; i++) s[i][0] =  ^ ;     for (int i = 0; i < 100; i += 2) {       for (int j = 1; j < 49; j++) s[i][j] =  > ;       for (int j = 49; j < 98; j += 2) {         s[i][j] =  > ;         s[i][j + 1] =  . ;       }       s[i][99] =  v ;     }     for (int i = 1; i < 100; i += 2) {       for (int j = 1; j < 49; j++) s[i][100 - j] =  < ;       for (int j = 49; j < 98; j += 2) {         s[i][100 - j] =  < ;         s[i][99 - j] =  . ;       }       s[i][1] =  v ;     }     s[99][1] =  . ;     for (int i = 0; i < 100; i++) printf( %s n , s[i]);     puts( 1 1 );   }   int main() {     scanf( %d%d , &n, &m);     if (n == 3 || n == 5) {       if (n == 3)         printf( >vv n^<. n^.< n1 3 n );       else         printf( >...v nv.<.. n..^.. n>.... n..^.< n1 1 n );     } else       work100();     return 0;   }   