#include <bits/stdc++.h>
using namespace std;
int N, M, P[5];
int ar[1100][1100], as[1100][1100];
int f() {
  for (int i = 1, k; i <= N; i++) {
    if (i & 1)
      k = 1;
    else
      k = 3;
    int flag = 0;
    for (int j = 1; j <= M; j++) as[i][j] = j & 1 ? P[k] : P[k + 1];
    for (int j = 1; j <= M; j++)
      if (ar[i][j] && ar[i][j] != as[i][j]) {
        flag = 1;
        break;
      }
    if (!flag) continue;
    flag = 0;
    for (int j = 1; j <= M; j++) as[i][j] = j & 1 ? P[k + 1] : P[k];
    for (int j = 1; j <= M; j++)
      if (ar[i][j] && ar[i][j] != as[i][j]) {
        flag = 1;
        break;
      }
    if (!flag) continue;
    return 0;
  }
  return 1;
}
int g() {
  for (int j = 1, k; j <= M; j++) {
    if (j & 1)
      k = 1;
    else
      k = 3;
    int flag = 0;
    for (int i = 1; i <= N; i++) as[i][j] = i & 1 ? P[k] : P[k + 1];
    for (int i = 1; i <= N; i++)
      if (ar[i][j] && ar[i][j] != as[i][j]) {
        flag = 1;
        break;
      }
    if (!flag) continue;
    flag = 0;
    for (int i = 1; i <= N; i++) as[i][j] = i & 1 ? P[k + 1] : P[k];
    for (int i = 1; i <= N; i++)
      if (ar[i][j] && ar[i][j] != as[i][j]) {
        flag = 1;
        break;
      }
    if (!flag) continue;
    return 0;
  }
  return 1;
}
int main() {
  cin >> N >> M;
  for (int i = 1; i <= N; i++)
    for (int j = 1; j <= M; j++) {
      char c;
      scanf(" %c", &c);
      ar[i][j] = c - '0';
    }
  P[1] = 1;
  P[2] = 2;
  P[3] = 3;
  P[4] = 4;
  do {
    if (f()) {
      for (int i = 1; i <= N; i++, puts(""))
        for (int j = 1; j <= M; j++) printf("%d", as[i][j]);
      return 0;
    }
  } while (next_permutation(P + 1, P + 1 + 4));
  P[1] = 1;
  P[2] = 2;
  P[3] = 3;
  P[4] = 4;
  do {
    if (g()) {
      for (int i = 1; i <= N; i++, puts(""))
        for (int j = 1; j <= M; j++) printf("%d", as[i][j]);
      return 0;
    }
  } while (next_permutation(P + 1, P + 1 + 4));
  printf("0\n");
  return 0;
}
