#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[1005][1005][5], b[1005][1005];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  memset(a, 0, sizeof(a));
  for (int i = 1; i <= (n << 1) - 1; i++) {
    if (i & 1) {
      for (int j = 1; j <= m - 1; j++) {
        char c = getchar();
        while (c != 'N' && c != 'E') c = getchar();
        a[(i + 1) >> 1][j][1] = (c == 'E');
      }
    } else {
      for (int j = 1; j <= m; j++) {
        char c = getchar();
        while (c != 'N' && c != 'E') c = getchar();
        a[i >> 1][j][2] = (c == 'E');
      }
    }
  }
  if (k == 1) {
    int p = 0;
    for (int i = 1; i < n; i++) {
      for (int j = 1; j < m; j++) {
        p += a[i][j][1] + a[i][j][2];
      }
    }
    for (int i = 1; i < n; i++) p += a[i][m][2];
    for (int i = 1; i < m; i++) p += a[n][i][1];
    if ((p << 2) >= ((n * (m - 1) + m * (n - 1)) * 3)) {
      puts("YES");
      for (int i = 1; i <= n; i++) {
        if (i > 1) putchar('\n');
        for (int j = 1; j <= m; j++) {
          if (j > 1) putchar(' ');
          putchar('1');
        }
      }
    } else {
      puts("NO");
    }
    return 0;
  }
  puts("YES");
  if (n < m) {
    for (int i = 1; i <= n; i++) b[i][1] = 0;
    for (int i = 1; i <= n; i++) {
      for (int j = 2; j <= m; j++) {
        b[i][j] = b[i][j - 1] ^ a[i][j - 1][1] ^ 1;
      }
    }
    for (int i = 2; i <= n; i++) {
      int p = 0;
      for (int j = 1; j <= m; j++) {
        p += ((b[i][j] != b[i - 1][j]) ^ (a[i - 1][j][2]));
      }
      if (p < ((m + 1) >> 1)) {
        for (int j = 1; j <= m; j++) b[i][j] ^= 1;
      }
    }
    for (int i = 1; i <= n; i++) {
      if (i > 1) putchar('\n');
      for (int j = 1; j <= m; j++) {
        if (j > 1) putchar(' ');
        putchar((48 ^ b[i][j]) + 1);
      }
    }
  } else {
    for (int i = 1; i <= m; i++) b[1][i] = 0;
    for (int i = 2; i <= n; i++) {
      for (int j = 1; j <= m; j++) {
        b[i][j] = b[i - 1][j] ^ a[i - 1][j][2] ^ 1;
      }
    }
    for (int i = 2; i <= m; i++) {
      int p = 0;
      for (int j = 1; j <= n; j++) {
        p += ((b[j][i] != b[j][i - 1]) ^ (a[j][i - 1][1]));
      }
      if (p < ((n + 1) >> 1)) {
        for (int j = 1; j <= n; j++) b[j][i] ^= 1;
      }
    }
    for (int i = 1; i <= n; i++) {
      if (i > 1) putchar('\n');
      for (int j = 1; j <= m; j++) {
        if (j > 1) putchar(' ');
        putchar((48 ^ b[i][j]) + 1);
      }
    }
  }
  return 0;
}
