#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int n, m, k;
int a[N][N];
char s[N << 1][N], t[N << 1][N];
inline bool getLeft(int x, int y) { return s[x << 1][y - 1] == 'N'; }
inline bool getUp(int x, int y) { return s[2 * x - 1][y] == 'N'; }
void solve(int h, int w, char s[][N]) {
  a[0][0] = 0;
  for (int j = (1); j < (w); ++j) a[0][j] = a[0][j - 1] ^ getLeft(0, j);
  int cnt = 0, tot = 0;
  for (int i = (1); i < (h); ++i) {
    a[i][0] = 0, cnt = a[i - 1][0] ^ getUp(i, 0);
    for (int j = (1); j < (w); ++j) {
      a[i][j] = a[i][j - 1] ^ getLeft(i, j);
      cnt += a[i][j] ^ a[i - 1][j] ^ getUp(i, j);
    }
    if (cnt > w - cnt) {
      cnt = w - cnt;
      for (int j = (0); j < (w); ++j) a[i][j] ^= 1;
    }
    tot += cnt;
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = (0); i < (2 * n - 1); ++i) scanf(" %s", s[i]);
  if (k == 1) {
    int cnt = 0;
    for (int i = (0); i < (n); ++i)
      for (int j = (0); j < (m); ++j) {
        if (i) cnt += getUp(i, j) ^ 1;
        if (j) cnt += getLeft(i, j) ^ 1;
      }
    int tot = n * (m - 1) + m * (n - 1);
    if (cnt * 4 >= 3 * tot) {
      puts("YES");
      for (int i = (0); i < (n); ++i) {
        for (int j = (0); j < (m); ++j) {
          if (j) putchar(' ');
          printf("%d", 1);
        }
        puts("");
      }
    } else {
      puts("NO");
    }
    return 0;
  }
  puts("YES");
  if (n <= m) {
    solve(n, m, s);
    for (int i = (0); i < (n); ++i) {
      for (int j = (0); j < (m); ++j) {
        if (j) putchar(' ');
        printf("%d", a[i][j] + 1);
      }
      puts("");
    }
  } else {
    for (int j = (0); j < (m); ++j) {
      for (int i = (0); i < (n); ++i) {
        if (i) t[2 * j][i - 1] = getUp(i, j) ? 'N' : 'E';
        if (j) t[2 * j - 1][i] = getLeft(i, j) ? 'N' : 'E';
      }
    }
    for (int i = (0); i < (2 * m - 1); ++i)
      for (int j = (0); j < (n - ((i & 1) ^ 1)); ++j) s[i][j] = t[i][j];
    solve(m, n, t);
    for (int i = (0); i < (n); ++i) {
      for (int j = (0); j < (m); ++j) {
        if (j) putchar(' ');
        printf("%d", a[j][i] + 1);
      }
      puts("");
    }
  }
  return 0;
}
