#include <bits/stdc++.h>
using namespace std;
int a[1005][1005];
int b[1004][1005];
int c[1005][1005];
char s[1005];
int id[4];
int flag;
int panduan(int n, int m) {
  for (int i = 2; i < m; i++) {
    for (int j = 0; j < 2; j++) {
      a[j][i] = a[j][i - 2];
    }
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < 2; j++) {
      if (b[j][i] != 0 && b[j][i] != a[j][i]) {
        return 0;
      }
    }
  }
  for (int i = 2; i < n; i++) {
    int x[2];
    x[0] = 0;
    x[1] = 0;
    for (int j = 0; j < m; j++) {
      if (x[j % 2] != 0 && b[i][j] != 0 && b[i][j] != x[j % 2]) {
        return 0;
      }
      if (b[i][j] != 0) x[j % 2] = b[i][j];
    }
    if (x[0] != 0) {
      if (x[1] != 0) {
        if (x[0] == x[1]) {
          return 0;
        }
        int xx = min(x[0], x[1]);
        int yy = max(x[0], x[1]);
        if (xx != min(a[i % 2][0], a[i % 2][1]) ||
            yy != max(a[i % 2][0], a[i % 2][1])) {
          return 0;
        }
      } else {
        if (x[0] != a[i % 2][0] && x[0] != a[i % 2][1]) {
          return 0;
        }
        x[1] = a[i % 2][0] + a[i % 2][1] - x[0];
      }
    } else if (x[1] != 0) {
      if (x[1] != a[i % 2][0] && x[1] != a[i % 2][1]) {
        return 0;
      }
      x[0] = a[i % 2][0] + a[i % 2][1] - x[1];
    } else {
      x[0] = a[i % 2][0];
      x[1] = a[i % 2][1];
    }
    for (int j = 0; j < m; j++) {
      a[i][j] = x[j % 2];
    }
  }
  return 1;
}
void solve(int n, int m) {
  for (int i = 0; i < 4; i++) {
    id[i] = i + 1;
  }
  do {
    a[0][0] = id[0];
    a[0][1] = id[1];
    a[1][0] = id[2];
    a[1][1] = id[3];
    if (panduan(n, m)) {
      flag = 1;
      return;
    }
  } while (next_permutation(id, id + 4));
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    scanf("%s", s);
    for (int j = 0; j < m; j++) {
      b[i][j] = s[j] - '0';
    }
  }
  solve(n, m);
  if (flag) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        printf("%d", a[i][j]);
      }
      printf("\n");
    }
    return 0;
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      c[j][i] = b[i][j];
    }
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      b[i][j] = c[i][j];
    }
  }
  solve(m, n);
  if (flag) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        printf("%d", a[j][i]);
      }
      printf("\n");
    }
    return 0;
  }
  printf("0\n");
  return 0;
}
