#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int n, m;
bool ex[MAXN][MAXN], ey[MAXN][MAXN];
int totalE = 0, total = 0;
int c[MAXN][MAXN];
bool Get() {
  char t;
  for (t = getchar(); t != 'E' && t != 'N'; t = getchar())
    ;
  if (t == 'E') {
    totalE++;
    total++;
    return true;
  } else {
    total++;
    return false;
  }
}
void read() {
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j < m; j++) ex[i][j] = Get();
    if (i != n)
      for (int j = 1; j <= m; j++) ey[i][j] = Get();
  }
}
void work1() {
  if (total * 3 <= totalE * 4) {
    printf("YES\n");
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= m; j++) printf("1 ");
      printf("\n");
    }
  } else {
    printf("NO\n");
  }
}
void work2() {
  printf("YES\n");
  if (n >= m) {
    for (int j = 1; j <= m; j++) {
      c[1][j] = 1;
      for (int i = 2; i <= n; i++) {
        if (ey[i - 1][j])
          c[i][j] = c[i - 1][j];
        else
          c[i][j] = 3 - c[i - 1][j];
      }
    }
    for (int j = 2; j <= m; j++) {
      int x = 0;
      for (int i = 1; i <= n; i++)
        if (ex[i][j - 1] ^ (c[i][j] == c[i][j - 1])) x++;
      if (x > n / 2) {
        for (int i = 1; i <= n; i++) c[i][j] = 3 - c[i][j];
      }
    }
  } else {
    for (int j = 1; j <= n; j++) {
      c[j][1] = 1;
      for (int i = 2; i <= m; i++) {
        if (ex[j][i - 1])
          c[j][i] = c[j][i - 1];
        else
          c[j][i] = 3 - c[j][i - 1];
      }
    }
    for (int j = 2; j <= n; j++) {
      int x = 0;
      for (int i = 1; i <= m; i++)
        if (ey[j - 1][i] ^ (c[j][i] == c[j - 1][i])) x++;
      if (x > m / 2) {
        for (int i = 1; i <= m; i++) c[j][i] = 3 - c[j][i];
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) printf("%d ", c[i][j]);
    printf("\n");
  }
}
int main() {
  int c;
  scanf("%d%d%d", &n, &m, &c);
  read();
  if (c == 1)
    work1();
  else
    work2();
  return 0;
}
