Problem: Important: All possible tests are in the pretest, so you shouldn't hack on this problem. So, if you passed pretests, you will also pass the system test.

You are an adventurer currently journeying inside an evil temple. After defeating a couple of weak monsters, you arrived at a square room consisting of tiles forming an n × n grid, surrounded entirely by walls. At the end of the room lies a door locked with evil magical forces. The following inscriptions are written on the door:

The sound of clashing rocks will awaken the door!

Being a very senior adventurer, you immediately realize what this means. In the room next door lies an infinite number of magical rocks. There are four types of rocks: 

  * '^': this rock moves upwards; 
  * '<': this rock moves leftwards; 
  * '>': this rock moves rightwards; 
  * 'v': this rock moves downwards. 



To open the door, you first need to place the rocks on some of the tiles (one tile can be occupied by at most one rock). Then, you select a single rock that you have placed and activate it. The activated rock will then move in its direction until it hits another rock or hits the walls of the room (the rock will not move if something already blocks it in its chosen direction). The rock then deactivates. If it hits the walls, or if there have been already 107 events of rock becoming activated, the movements end. Otherwise, the rock that was hit becomes activated and this procedure is repeated.

If a rock moves at least one cell before hitting either the wall or another rock, the hit produces a sound. The door will open once the number of produced sounds is at least x. It is okay for the rocks to continue moving after producing x sounds.

The following picture illustrates the four possible scenarios of moving rocks.

  * Moves at least one cell, then hits another rock. A sound is produced, the hit rock becomes activated. <image>
  * Moves at least one cell, then hits the wall (i.e., the side of the room). A sound is produced, the movements end. <image>
  * Does not move because a rock is already standing in the path. The blocking rock becomes activated, but no sounds are produced. <image>
  * Does not move because the wall is in the way. No sounds are produced and the movements end. <image>



Assume there's an infinite number of rocks of each type in the neighboring room. You know what to do: place the rocks and open the door!

Input

The first line will consists of two integers n and x, denoting the size of the room and the number of sounds required to open the door. There will be exactly three test cases for this problem:

  * n = 5, x = 5; 
  * n = 3, x = 2; 
  * n = 100, x = 105. 



All of these testcases are in pretest.

Output

Output n lines. Each line consists of n characters — the j-th character of the i-th line represents the content of the tile at the i-th row and the j-th column, and should be one of these:

  * '^', '<', '>', or 'v': a rock as described in the problem statement. 
  * '.': an empty tile. 



Then, output two integers r and c (1 ≤ r, c ≤ n) on the next line — this means that the rock you activate first is located at the r-th row from above and c-th column from the left. There must be a rock in this cell.

If there are multiple solutions, you may output any of them.

Examples

Input

5 5


Output

&gt;...v
v.&lt;..
..^..
&gt;....
..^.&lt;
1 1


Input

3 2


Output

&gt;vv
^&lt;.
^.&lt;
1 3

Note

Here's a simulation of the first example, accompanied with the number of sounds produced so far.

<image> 0 sound  <image> 1 sound  <image> 2 sounds  <image> 3 sounds  <image> 4 sounds  <image> still 4 sounds 

In the picture above, the activated rock switches between the '^' rock and the '<' rock. However, no sound is produced since the '^' rock didn't move even a single tile. So, still 4 sound.

<image> 5 sounds 

At this point, 5 sound are already produced, so this solution is already correct. However, for the sake of example, we will continue simulating what happens.

<image> 6 sounds  <image> 7 sounds  <image> still 7 sounds  <image> 8 sounds 

And the movement stops. In total, it produces 8 sounds. Notice that the last move produced sound.

Here's a simulation of the second example:

<image> 0 sound  <image> 1 sound  <image> 2 sounds 

Now, the activated stone will switch continuously from one to another without producing a sound until it reaches the 107 limit, after which the movement will cease.

<image>

In total, it produced exactly 2 sounds, so the solution is correct.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.Locale;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class Solution implements Runnable {
	
	BufferedReader in;
	PrintWriter out;
	StringTokenizer st;
	
	String nextToken() throws Exception {
		if (st == null || !st.hasMoreTokens()) st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}
	
	int nextInt() throws Exception {
		return Integer.parseInt(nextToken());
	}
	
	long nextLong() throws Exception {
		return Long.parseLong(nextToken());
	}
	
	void solve() throws Exception {
		int qq = nextInt(), w = nextInt();
		if (qq == 5 && w == 5) {
			out.println(">...v\nv.<..\n..^..\n>....\n..^.<\n1 1");
			return;
		}
		if (qq == 3 && w == 2) {
			out.println(">vv\n^<.\n^.<\n1 3");
			return;
		}
		int n = 100;
		char[][] a = new char[n][n];
		for (char[] q : a) Arrays.fill(q, '.');
		for (int j = 0; j < 100; j++) {
			for (int i = 0; i < 49; i++) {
				if (j % 2 == 0) {
					a[i + 1][j] = 'v';
				} else {
					a[99 - i][j] = '^';
				}
			}
			for (int i = 49; i < 98; i++) {
				if (j % 2 == 0) {
					a[i + 1][j] = (i % 2 == 1? '.' : 'v');
				} else {
					a[99 - i][j] = (i % 2 == 1? '.' : '^');
				}
			}
			if (j % 2 == 0) {
				a[99][j] = '>';
			} else {
				a[1][j] = '>';
			}
		}
		a[1][99] = '^';
		for (int i = 0; i < 49; i++) a[0][99 - i] = '<';
		for (int i = 49; i < 98; i++) a[0][99 - i] = (i % 2 == 1? '.' : '<');
		a[0][0] = 'v';
		for (int i = 0; i < 100; i++) {
			for (int j = 0; j < 100; j++) {
				out.print(a[i][j]);
			}
			out.println();
		}
		out.println("1 1");
/*		int act = 1;
		int ud = 0;
		int x = 0, y = 0;
		while (true) {
			int dx = 0, dy = 0;
			switch (a[x][y]) {
			case 'v': dx = 1; break;
			case '^': dx = -1; break;
			case '<': dy = -1; break;
			case '>': dy = 1; break;
			}
			char c = a[x][y];
			a[x][y] = '.';
			int nx = x, ny = y;
			while (nx >= 0 && nx < 100 && ny >= 0 && ny < 100 && a[nx][ny] == '.') {
				nx += dx; ny += dy;
			}
			boolean stn = !(nx >= 0 && nx < 100 && ny >= 0 && ny < 100);
			nx -= dx; ny -= dy;
			if (nx != x || ny != y) ud++;
			if (stn) break;
			act++;
			x = nx + dx; y = ny + dy;
			a[nx][ny] = c;
			if (act >= 10000000) break;
		}
		out.println(act + " " + ud);*/
	}
	
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
//			String s = "number";
//			in = new BufferedReader(new FileReader(s + ".in"));
//			out = new PrintWriter(s + ".out");
			Locale.setDefault(Locale.US);
//			for (int tt = nextInt(); tt > 0; tt--)
				solve();
		} catch(Exception e) {
			e.printStackTrace();
			System.exit(1);
		} finally {
			out.close();
		}
	}

	public static void main(String[] args) {
		(new Thread(null, new Solution(), "1", 1 << 26)).start();
	}
	
}