/* #region header */
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
void debug() { cout << endl; }
template <typename Head, typename... Tail>
void debug(Head H, Tail... T) {
    cout << " " << H;
    debug(T...);
}
#else
#define debug(...) 42
#endif
// types
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vc;
template <typename T>
using mat = vector<vector<T>>;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<vector<char>> vvc;

// abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) for (ll i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) \
    for (ll i = (b - 1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((ll)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vprint(x)                         \
    rep(i, x.size()) cout << x[i] << ' '; \
    cout << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
// functions
// gcd(0, x) fails.
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
T mypow(T x, ll n) {
    T ret = 1;
    while (n > 0) {
        if (n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}
ll modpow(ll x, ll n, const ll mod) {
    ll ret = 1;
    while (n > 0) {
        if (n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
        x %= mod;
        ret %= mod;
    }
    return ret;
}
uint64_t my_rand(void) {
    static uint64_t x = 88172645463325252ULL;
    x = x ^ (x << 13);
    x = x ^ (x >> 7);
    return x = x ^ (x << 17);
}
ll popcnt(ull x) { return __builtin_popcountll(x); }
// graph template
template <typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}

    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    bool operator<(const edge<T> &r) const { return cost < r.cost; }

    operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
struct Timer {
    clock_t start_time;
    void start() { start_time = clock(); }
    int lap() {
        // return x ms.
        return (clock() - start_time) * 1000 / CLOCKS_PER_SEC;
    }
};
/* #endregion*/
// constant
#define inf 1000000005
#define INF 4000000004000000000LL
#define mod 1000000007LL
#define endl '\n'
const long double eps = 0.000001;
const long double PI = 3.141592653589793;
// library
const vi dx = {0, 1, 0, -1};
const vi dy = {1, 0, -1, 0};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(20);
    int n, m;
    cin >> n >> m;
    mat<char> s(n, vc(m));
    rep(i, n) rep(j, m) cin >> s[i][j];
    mf_graph<ll> graph(n * m + 2);
    rep(i, n) rep(j, m) {
        if (s[i][j] == '#') continue;
        if ((i + j) % 2 == 1) {
            graph.add_edge(i * m + j, n * m + 1, 1);
            continue;
        }
        graph.add_edge(n * m, i * m + j, 1);
        rep(d, 4) {
            int nx = i + dx[d];
            int ny = j + dy[d];
            if (0 <= nx && nx < n && 0 <= ny && ny < m && s[nx][ny] == '.') {
                graph.add_edge(i * m + j, nx * m + ny, 1);
            }
        }
    }
    print(graph.flow(m * n, m * n + 1));
    vector<mf_graph<ll>::edge> edges = graph.edges();
    for (auto edge : edges) {
        if (edge.from >= n * m || edge.to >= n * m) continue;
        if (edge.flow == 1) {
            int si = edge.from / m, sj = edge.from % m;
            int ti = edge.to / m, tj = edge.to % m;
            if (si == ti) {
                if (sj > tj) swap(si, ti), swap(sj, tj);
                s[si][sj] = '>';
                s[ti][tj] = '<';
            } else {
                if (si > ti) swap(si, ti), swap(sj, tj);
                s[si][sj] = 'v';
                s[ti][tj] = '^';
            }
        }
    }
    rep(i, n) {
        rep(j, m) cout << s[i][j];
        cout << endl;
    }
}

Measured memory_bytes: 6296