#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
int a[maxn][maxn];
int col[maxn][maxn];
vector<int> v[maxn];
vector<int> r1, r2;
bool mark[5];
int n, m;
bool Solve_Row() {
  for (int i = 1; i <= n; i++) {
    memset(mark, 0, sizeof(mark));
    for (int j = 1; j <= m; j++) {
      if (a[i][j] != 0 && !mark[a[i][j]]) {
        v[i].push_back(a[i][j]);
        mark[a[i][j]] = true;
      }
    }
  }
  for (int i = 1; i <= n; i++)
    if (v[i].size() > 2) return false;
  for (int i = 1; i <= n; i += 2)
    for (int j = 0; j < v[i].size(); j++) r1.push_back(v[i][j]);
  for (int i = 2; i <= n; i += 2)
    for (int j = 0; j < v[i].size(); j++) r2.push_back(v[i][j]);
  sort(r1.begin(), r1.end());
  sort(r2.begin(), r2.end());
  r1.resize(unique(r1.begin(), r1.end()) - r1.begin());
  r2.resize(unique(r2.begin(), r2.end()) - r2.begin());
  if (r1.size() > 2 || r2.size() > 2) return false;
  for (int i = 0; i < r1.size(); i++) {
    for (int j = 0; j < r2.size(); j++) {
      if (r1[i] == r2[j]) return false;
    }
  }
  memset(mark, 0, sizeof(mark));
  for (int i = 0; i < r1.size(); i++) mark[r1[i]] = true;
  for (int i = 0; i < r2.size(); i++) mark[r2[i]] = true;
  while (r1.size() < 2) {
    for (int i = 1; i <= 4; i++)
      if (!mark[i]) {
        mark[i] = true;
        r1.push_back(i);
        break;
      }
  }
  while (r2.size() < 2) {
    for (int i = 1; i <= 4; i++)
      if (!mark[i]) {
        mark[i] = true;
        r2.push_back(i);
        break;
      }
  }
  for (int i = 1; i <= n; i += 2) {
    for (int k = 0; k < r1.size(); k++) {
      bool F = 0;
      bool Z = 0;
      for (int j = 1; j <= m; j++) {
        if (a[i][j] == r1[k]) {
          if (j % 2)
            F = true;
          else
            Z = true;
        }
      }
      if (F && Z) return false;
    }
  }
  for (int i = 2; i <= n; i += 2) {
    for (int k = 0; k < r2.size(); k++) {
      bool F = 0;
      bool Z = 0;
      for (int j = 1; j <= m; j++) {
        if (a[i][j] == r2[k]) {
          if (j % 2)
            F = true;
          else
            Z = true;
        }
      }
      if (F && Z) return false;
    }
  }
  for (int i = 1; i <= n; i += 2) {
    int f = 0;
    int z = 0;
    for (int j = 1; j <= m; j++) {
      if (a[i][j] != 0) {
        if (j % 2)
          f = a[i][j];
        else
          z = a[i][j];
      }
    }
    if (f == 0 && z == 0) {
      f = r1[0];
      z = r1[1];
    } else if (f == 0) {
      if (z == r1[0])
        f = r1[1];
      else
        f = r1[0];
    } else if (z == 0) {
      if (f == r1[0])
        z = r1[1];
      else
        z = r1[0];
    }
    for (int j = 1; j <= m; j++) {
      if (j % 2)
        col[i][j] = f;
      else
        col[i][j] = z;
    }
  }
  for (int i = 2; i <= n; i += 2) {
    int f = 0;
    int z = 0;
    for (int j = 1; j <= m; j++) {
      if (a[i][j] != 0) {
        if (j % 2)
          f = a[i][j];
        else
          z = a[i][j];
      }
    }
    if (f == 0 && z == 0) {
      f = r2[0];
      z = r2[1];
    } else if (f == 0) {
      if (z == r2[0])
        f = r2[1];
      else
        f = r2[0];
    } else if (z == 0) {
      if (f == r2[0])
        z = r2[1];
      else
        z = r2[0];
    }
    for (int j = 1; j <= m; j++) {
      if (j % 2)
        col[i][j] = f;
      else
        col[i][j] = z;
    }
  }
  return true;
}
bool Solve_Column() {
  for (int i = 1; i <= m; i++) {
    memset(mark, 0, sizeof(mark));
    for (int j = 1; j <= n; j++) {
      if (a[j][i] != 0 && !mark[a[j][i]]) {
        v[i].push_back(a[j][i]);
        mark[a[j][i]] = true;
      }
    }
  }
  for (int i = 1; i <= m; i++)
    if (v[i].size() > 2) return false;
  for (int i = 1; i <= m; i += 2)
    for (int j = 0; j < v[i].size(); j++) r1.push_back(v[i][j]);
  for (int i = 2; i <= m; i += 2)
    for (int j = 0; j < v[i].size(); j++) r2.push_back(v[i][j]);
  sort(r1.begin(), r1.end());
  sort(r2.begin(), r2.end());
  r1.resize(unique(r1.begin(), r1.end()) - r1.begin());
  r2.resize(unique(r2.begin(), r2.end()) - r2.begin());
  if (r1.size() > 2 || r2.size() > 2) return false;
  for (int i = 0; i < r1.size(); i++) {
    for (int j = 0; j < r2.size(); j++) {
      if (r1[i] == r2[j]) return false;
    }
  }
  memset(mark, 0, sizeof(mark));
  for (int i = 0; i < r1.size(); i++) mark[r1[i]] = true;
  for (int i = 0; i < r2.size(); i++) mark[r2[i]] = true;
  while (r1.size() < 2) {
    for (int i = 1; i <= 4; i++)
      if (!mark[i]) {
        mark[i] = true;
        r1.push_back(i);
        break;
      }
  }
  while (r2.size() < 2) {
    for (int i = 1; i <= 4; i++)
      if (!mark[i]) {
        mark[i] = true;
        r2.push_back(i);
        break;
      }
  }
  for (int i = 1; i <= m; i += 2) {
    for (int k = 0; k < r1.size(); k++) {
      bool F = 0;
      bool Z = 0;
      for (int j = 1; j <= n; j++) {
        if (a[j][i] == r1[k]) {
          if (j % 2)
            F = true;
          else
            Z = true;
        }
      }
      if (F && Z) return false;
    }
  }
  for (int i = 2; i <= m; i += 2) {
    for (int k = 0; k < r2.size(); k++) {
      bool F = 0;
      bool Z = 0;
      for (int j = 1; j <= n; j++) {
        if (a[j][i] == r2[k]) {
          if (j % 2)
            F = true;
          else
            Z = true;
        }
      }
      if (F && Z) return false;
    }
  }
  for (int i = 1; i <= m; i += 2) {
    int f = 0;
    int z = 0;
    for (int j = 1; j <= n; j++) {
      if (a[j][i] != 0) {
        if (j % 2)
          f = a[j][i];
        else
          z = a[j][i];
      }
    }
    if (f == 0 && z == 0) {
      f = r1[0];
      z = r1[1];
    } else if (f == 0) {
      if (z == r1[0])
        f = r1[1];
      else
        f = r1[0];
    } else if (z == 0) {
      if (f == r1[0])
        z = r1[1];
      else
        z = r1[0];
    }
    for (int j = 1; j <= n; j++) {
      if (j % 2)
        col[j][i] = f;
      else
        col[j][i] = z;
    }
  }
  for (int i = 2; i <= m; i += 2) {
    int f = 0;
    int z = 0;
    for (int j = 1; j <= n; j++) {
      if (a[j][i] != 0) {
        if (j % 2)
          f = a[j][i];
        else
          z = a[j][i];
      }
    }
    if (f == 0 && z == 0) {
      f = r2[0];
      z = r2[1];
    } else if (f == 0) {
      if (z == r2[0])
        f = r2[1];
      else
        f = r2[0];
    } else if (z == 0) {
      if (f == r2[0])
        z = r2[1];
      else
        z = r2[0];
    }
    for (int j = 1; j <= n; j++) {
      if (j % 2)
        col[j][i] = f;
      else
        col[j][i] = z;
    }
  }
  return true;
}
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      char c;
      cin >> c;
      a[i][j] = c - '0';
    }
  }
  if (Solve_Row()) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        cout << col[i][j];
      }
      cout << endl;
    }
    return 0;
  }
  memset(col, 0, sizeof(col));
  for (int i = 1; i <= n; i++) v[i].clear();
  memset(mark, 0, sizeof(mark));
  r1.clear();
  r2.clear();
  if (Solve_Column()) {
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        cout << col[i][j];
      }
      cout << endl;
    }
    return 0;
  }
  cout << 0;
}
