#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000 + 7;
int ans[MAX_N][MAX_N];
char G1[MAX_N][MAX_N], G2[MAX_N][MAX_N];
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  int sum = n * (m - 1) + m * (n - 1), cnt = 0;
  for (int i = 0; i < n; i++) {
    scanf("%s", G1[i]);
    for (int j = 0; j < m - 1; j++) {
      cnt += (G1[i][j] == 'E');
    }
    if (i < n - 1) {
      scanf("%s", G2[i]);
      for (int j = 0; j < m; j++) {
        cnt += (G2[i][j] == 'E');
      }
    }
  }
  if (k == 1) {
    if (cnt * 4 < 3 * sum) {
      puts("NO");
      return 0;
    }
    puts("YES");
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        printf("1%c", " \n"[j == m - 1]);
      }
    }
    return 0;
  }
  puts("YES");
  bool flag = 0;
  if (n > m) {
    flag = 1;
    swap(n, m);
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < m; j++) swap(G1[i][j], G2[j][i]);
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 1; j < m; j++) {
      ans[i][j] = (G1[i][j - 1] == 'N') ^ ans[i][j - 1];
    }
    cnt = 0;
    if (i) {
      for (int j = 0; j < m; j++) {
        cnt += (G2[i - 1][j] == 'E') != (ans[i - 1][j] == ans[i][j]);
      }
    }
    if (cnt * 2 >= m) {
      for (int j = 0; j < m; j++) ans[i][j] ^= 1;
    }
  }
  if (flag) {
    for (int i = 0; i < m; i++) {
      for (int j = 0; j < n; j++) {
        printf("%d%c", ans[j][i] + 1, " \n"[j == n - 1]);
      }
    }
  } else {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        printf("%d%c", ans[i][j] + 1, " \n"[j == m - 1]);
      }
    }
  }
  return 0;
}
