#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return a > val ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
int n, m;
vector<vector<int> > a;
int check(vector<vector<int> > res) {
  int n = int((res).size()), m = int((res[0]).size());
  for (int i = (0); i < (n); i++)
    for (int j = (0); j < (m); j++) {
      for (int u = (-1); u < (2); u++)
        for (int v = (-1); v < (2); v++) {
          if (u != 0 || v != 0) {
            if (i + u >= 0 && i + u < n && j + v >= 0 && j + v < m) {
              if (res[i][j] == res[i + u][j + v]) {
                return 0;
              }
            }
          }
        }
    }
  return 1;
}
int work(vector<vector<int> >& res) {
  int n = int((res).size()), m = int((res[0]).size());
  vector<vector<int> > a = res;
  int p[] = {1, 2, 3, 4};
  do {
    int OK = 1;
    for (int i = (0); i < (n); i++) {
      if (i & 1) {
        int ok = 1;
        for (int j = (0); j < (m); j++) {
          if (j & 1) {
            res[i][j] = p[0];
          } else {
            res[i][j] = p[1];
          }
          if (a[i][j] && a[i][j] != res[i][j]) {
            ok = 0;
            break;
          }
        }
        if (!ok) {
          ok = 1;
          for (int j = (0); j < (m); j++) {
            if (j & 1) {
              res[i][j] = p[1];
            } else {
              res[i][j] = p[0];
            }
            if (a[i][j] && a[i][j] != res[i][j]) {
              ok = 0;
              break;
            }
          }
        }
        if (!ok) {
          OK = 0;
          break;
        }
      } else {
        int ok = 1;
        for (int j = (0); j < (m); j++) {
          if (j & 1) {
            res[i][j] = p[2];
          } else {
            res[i][j] = p[3];
          }
          if (a[i][j] && a[i][j] != res[i][j]) {
            ok = 0;
            break;
          }
        }
        if (!ok) {
          ok = 1;
          for (int j = (0); j < (m); j++) {
            if (j & 1) {
              res[i][j] = p[3];
            } else {
              res[i][j] = p[2];
            }
            if (a[i][j] && a[i][j] != res[i][j]) {
              ok = 0;
              break;
            }
          }
        }
        if (!ok) {
          OK = 0;
          break;
        }
      }
    }
    if (OK && check(res)) {
      return 1;
    }
  } while (next_permutation(p, p + 4));
  return 0;
}
void solve() {
  cin >> n >> m;
  a.resize(n, vector<int>(m, 0));
  for (int i = (0); i < (n); i++) {
    string s;
    cin >> s;
    for (int j = (0); j < (m); j++) a[i][j] = s[j] - '0';
  }
  vector<vector<int> > res = a;
  if (work(res)) {
    for (int i = (0); i < (n); i++) {
      for (int j = (0); j < (m); j++) cout << res[i][j];
      cout << "\n";
    }
  } else {
    vector<vector<int> > res(m, vector<int>(n, 0));
    for (int i = (0); i < (n); i++)
      for (int j = (0); j < (m); j++) {
        res[j][i] = a[i][j];
      }
    if (work(res)) {
      for (int i = (0); i < (n); i++) {
        for (int j = (0); j < (m); j++) cout << res[j][i];
        cout << "\n";
      }
    } else {
      cout << "0\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
