import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.TreeMap;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int t = in.nextInt();
		int a = in.nextInt();
		int b = in.nextInt();
		int dist = Math.max(a, b);
		if(t < dist){
			System.out.println("NO");
			return;
		}
		int x = 0;
		int y = 0;
		if(a == 0 && b == 0){
			t--;
			y--;
			x--;
			dist = 1;
			if(t==0){
				System.out.println("NO");
				return;
			}else{
				System.out.println("YES");
				System.out.println("v<");
			}
		}else
			System.out.println("YES");
		String[] sp1 = {">", "<"};
		String[] sp2 = {"^", "v"};
		for(int i=0; i<dist-1; i++){
			int dy = a-y;
			int dx = b-x;
			String cmd = "";
			if(dy > 0){
				cmd += "^";
				y++;
			}
			if(dx > 0){
				cmd += ">";
				x++;
			}
			System.out.println(cmd);
		}
		boolean isUD = false;
		if(a-y == 0) isUD = true;
		for(int i=0; i<t-(dist); i++){
			if(isUD){
				System.out.println(sp2[i%2]);
				if(i%2 == 0){
					y++;
				}else y--;
				continue;
			}
			System.out.println(sp1[i%2]);
			if(i%2 == 0){
				x++;
			}else x--;
		}
		int dy = a-y;
		int dx = b-x;
		String cmd = "";
		if(dy > 0){
			cmd += "^";
		}
		if(dx > 0){
			cmd += ">";
		}
		System.out.println(cmd);
	}
}

class A implements Comparable<A>{
	int id;
	int a;
	A(int id, int a){
		this.id = id;
		this.a = a;
	}
	@Override
	public int compareTo(A o) {
		return o.a - a;
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

class Node{
	int id;
	ArrayList<Node> edge = new ArrayList<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}