#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
int n, m;
char input[105][105];
char output[105][105];

void printer() {
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			cout << output[i][j];
		}
		cout << "\n";
	}
}

char converter(char c) {
	switch (c)
	{
	case 46:
		return '.';
	case 79:
		return 'O';
	case 45:
		return '|';
	case 124:
		return '-';
	case 47:
		return '\\';
	case 92:
		return '/';
	case 94:
		return '<';
	case 60:
		return 'v';
	case 118:
		return '>';
	case 62:
		return '^';
	default:
		return '.';
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> input[i][j];
		}
	}


	for (int j = m - 1; j >= 0; j--) {
		for (int i = 0; i < n; i++) {
			output[m - j - 1][i] = converter(input[i][j]);
		}
	}
	printer();

	return 0;
}