#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T>
typename T::value_type arr_sum(const T& v, int n) {
  typename T::value_type sum = 0;
  for (int i = (0); i < (n); ++i) sum += v[i];
  return sum;
}
struct Sync_stdio {
  Sync_stdio() {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
  }
} _sync_stdio;
int n, m, r = 0;
void check(vector<vector<int>>& v) {
  vector<int> used(4, -1);
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (m); ++j) {
      if (v[i][j] != 0) {
        if (used[v[i][j] - 1] == (i + 1) % 2) {
          return;
        }
        used[v[i][j] - 1] = i % 2;
      }
    }
  }
  if (count(used.begin(), used.end(), 0) > 2 ||
      count(used.begin(), used.end(), 1) > 2) {
    return;
  }
  for (int i = (0); i < (4); ++i) {
    if (used[i] == -1 && count(used.begin(), used.end(), 0) < 2) {
      used[i] = 0;
    }
  }
  for (int i = (0); i < (4); ++i) {
    if (used[i] == -1) {
      used[i] = 1;
    }
  }
  vector<vector<int>> a(2);
  for (int i = (0); i < (4); ++i) {
    a[used[i]].push_back(i + 1);
  }
  vector<vector<int>> ans(n);
  for (int i = (0); i < (n); ++i) {
    int flag = 0;
    for (int j = (0); j < (m); ++j) {
      if (v[i][j] == 0) {
        continue;
      }
      if (a[i % 2][(j + 1) % 2] == v[i][j]) {
        if (flag) {
          return;
        }
        flag = 1;
        swap(a[i % 2][0], a[i % 2][1]);
      }
      if (a[i % 2][j % 2] == v[i][j]) {
        flag = 1;
      }
    }
    ans[i] = a[i % 2];
  }
  if (r == 0) {
    for (int i = (0); i < (n); ++i) {
      for (int j = (0); j < (m); ++j) {
        cout << ans[i][j % 2];
      }
      cout << "\n";
    }
  } else {
    for (int j = (0); j < (m); ++j) {
      for (int i = (0); i < (n); ++i) {
        cout << ans[i][j % 2];
      }
      cout << "\n";
    }
  }
  exit(0);
}
int main() {
  cin >> n >> m;
  vector<string> v(n);
  vector<vector<int>> w1(n, vector<int>(m));
  vector<vector<int>> w2(m, vector<int>(n));
  for (int i = 0; i < (n); ++i) cin >> v[i];
  ;
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (m); ++j) {
      w1[i][j] = v[i][j] - '0';
    }
  }
  for (int i = (0); i < (n); ++i) {
    for (int j = (0); j < (m); ++j) {
      w2[j][i] = w1[i][j];
    }
  }
  check(w1);
  swap(n, m);
  r = 1;
  check(w2);
  cout << 0;
  return 0;
}
