#include <bits/stdc++.h>
using namespace std;
bool a[1005][1005];
char s[2005][1005];
int main() {
  int n, m, col, i, j, tot;
  scanf("%d%d%d", &n, &m, &col);
  for (i = 1; i <= n * 2 - 1; i++) scanf("%s", s[i] + 1);
  if (col == 1) {
    tot = 0;
    for (i = 1; i <= n * 2 - 1; i++)
      for (j = 1; j <= m - (i & 1); j++) tot += s[i][j] == 'E';
    if (tot * 4 >= (n * m * 2 - n - m) * 3) {
      puts("YES");
      for (i = 1; i <= n; i++, puts(""))
        for (j = 1; j <= m; j++) printf("1 ");
    } else
      puts("NO");
  } else {
    puts("YES");
    if (n > m) {
      for (i = 2; i <= n; i++)
        if (s[i - 1 << 1][1] == 'E')
          a[i][1] = a[i - 1][1];
        else
          a[i][1] = !a[i - 1][1];
      for (j = 2; j <= m; j++) {
        tot = 0;
        if ((a[1][j] == a[1][j - 1]) == (s[1][j - 1] == 'E')) tot++;
        for (i = 2; i <= n; i++) {
          if (s[i - 1 << 1][j] == 'E')
            a[i][j] = a[i - 1][j];
          else
            a[i][j] = !a[i - 1][j];
          if ((a[i][j] == a[i][j - 1]) == (s[i * 2 - 1][j - 1] == 'E')) tot++;
        }
        if (tot * 2 < n)
          for (i = 1; i <= n; i++) a[i][j] ^= 1;
      }
    } else {
      for (j = 2; j <= m; j++)
        if (s[1][j - 1] == 'E')
          a[1][j] = a[1][j - 1];
        else
          a[1][j] = !a[1][j - 1];
      for (i = 2; i <= n; i++) {
        tot = 0;
        if ((a[i][1] == a[i - 1][1]) == (s[i - 1 << 1][1] == 'E')) tot++;
        for (j = 2; j <= m; j++) {
          if (s[i * 2 - 1][j - 1] == 'E')
            a[i][j] = a[i][j - 1];
          else
            a[i][j] = !a[i][j - 1];
          if ((a[i][j] == a[i - 1][j]) == (s[i - 1 << 1][j] == 'E')) tot++;
        }
        if (tot * 2 < m)
          for (j = 1; j <= m; j++) a[i][j] ^= 1;
      }
    }
    for (i = 1; i <= n; i++, puts(""))
      for (j = 1; j <= m; j++) printf("%d ", a[i][j] + 1);
  }
  return 0;
}
