#include <bits/stdc++.h>
#define int long long
const int N = 1005;
const int Mod = 1e9 + 7;
using namespace std;
int n, m;
char a[N][N];
int dis[N][N];
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
char c[4] = {'<', 'v', '>', '^'};
struct node
{
    int x, y, d;
};
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    queue<node> q;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            dis[i][j] = 1e18;
            cin >> a[i][j];
            if (a[i][j] == 'E')
            {
                dis[i][j] = 0;
                q.push({i, j, 0});
            }
        }
    }
    while (!q.empty())
    {
        auto [x, y, d] = q.front();
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            int tx = x + dx[i];
            int ty = y + dy[i];
            if (tx < 1 || tx > n || ty < 1 || ty > m)
            {
                continue;
            }
            if (a[tx][ty] == '#')
            {
                continue;
            }
            if (d + 1 >= dis[tx][ty])
            {
                continue;
            }
            dis[tx][ty] = d + 1;
            a[tx][ty] = c[i];
            q.push({tx, ty, d + 1});
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cout << a[i][j];
        }
        cout << endl;
    }
    return 0;
}