#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef priority_queue<int> maxHeap;
typedef priority_queue<int, vector<int>, greater<int>> minHeap;
#define inputArray(a, n) \
    for (int i = 0; i < n; i++) cin >> a[i];
#define printArray(a, n) \
    for (int i = 0; i < n; i++) cout << a[i] << endl;
typedef pair<int, int> pii;
#define endl "\n"
#define PB push_back
#define MP make_pair
#define FF first
#define SS second
#define int long long
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
#define clr(val, val1) memset(val, val1, sizeof(val))
// #define LOCAL

void __init() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

void print(vector<vector<int>> out, int n, int m) {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cout << out[i][j] << " ";
        }
        cout << endl;
    }
}

void solve(int i, int j, int n, int m, vector<vector<int>> k, vector<vector<int>> out) {
    if (i == n and j == m) {
        print(out, n, m);
        return;
    }

    if ((i == n && k[i][j + 1] == 0) || (j == m && k[i + 1][j] == 0) || (k[i + 1][j] == 0 && k[i][j + 1] == 0)) {
        return;
    }

    int flag = 0, temp;
    if (k[i][j + 1] == 1) {
        flag = 1;
        temp = out[i][j + 1];
        out[i][j + 1] = 1;
        solve(i, j + 1, n, m, k, out);
    }

    if (k[i + 1][j] == 1) {
        out[i + 1][j] = 1;
        if (flag == 1) {
            out[i][j + 1] = temp;
        }
        solve(i + 1, j, n, m, k, out);
    }
}

int32_t main() {
    __init();
    int n, m;
    cin >> n >> m;
    vector<vector<int>> k(n + 1, vector<int>(m + 1));
    for (int i = 1; i < n + 1; i++) {
        for (int j = 1; j < m + 1; j++) {
            char x;
            cin >> x;
            if (x == 'O')
                k[i][j] = 1;
            else
                k[i][j] = 0;
        }
    }


    vector<vector<int>> out(n + 1, vector<int>(m + 1));
    for (int i = 1; i < n + 1; i++) {
        for (int j = 1; j < m + 1; j++) {
            out[i][j] = 0;
        }
    }
    out[1][1] = 1;
    solve(1, 1, n, m, k, out);

    return 0;
}