#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <class T, class U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &x) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-' && c != -1)
    ;
  if (c == -1) return;
  if (c == '-') sg = 1, c = getchar();
  for (x = 0; c >= '0' && c <= '9';
       x = (x << 1) + (x << 3) + c - '0', c = getchar())
    ;
  if (sg) x = -x;
}
template <class T>
void print(T x) {
  if (x < 0) return putchar('-'), print(-x);
  if (x < 10) {
    putchar(x + '0');
    return;
  }
  print(x / 10);
  putchar(x % 10 + '0');
}
template <class U, class V>
inline void gn(U &u, V &v) {
  gn(u);
  gn(v);
}
template <class U, class V, class W>
inline void gn(U &u, V &v, W &w) {
  gn(u);
  gn(v, w);
}
template <class T>
void println(T &x) {
  print(x);
  putchar('\n');
}
template <class T>
void printsp(T &x) {
  print(x);
  putchar(' ');
}
template <class U, class V>
inline void print(U &u, V &v) {
  printsp(u);
  println(v);
}
template <class U, class V, class W>
inline void print(U &u, V &v, W &w) {
  printsp(u);
  print(v, w);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; a = (long long)a * a % m, b >>= 1)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
char row[1111][1111], col[1111][1111];
int ans[1111][1111];
int main() {
  int n, m, k;
  gn(n, m, k);
  for (int i = 0; i < n; i++) {
    scanf("%s", row[i]);
    if (i < n - 1) scanf("%s", col[i]);
  }
  int cnt;
  if (k == 1) {
    cnt = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m - 1; j++) {
        if (row[i][j] == 'E') cnt++;
      }
      if (i) {
        for (int j = 0; j < m; j++) {
          if (col[i - 1][j] == 'E') cnt++;
        }
      }
    }
    if (4 * cnt >= 3 * (n * (m - 1) + m * (n - 1))) {
      puts("YES");
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) printf("%d ", 1);
        puts("");
      }
      return 0;
    }
    puts("NO");
    return 0;
  }
  puts("YES");
  if (n <= m) {
    for (int i = 0; i < n; i++) {
      ans[i][0] = 1;
      for (int j = 0; j < m - 1; j++) {
        if (row[i][j] == 'E') {
          ans[i][j + 1] = ans[i][j];
        } else {
          ans[i][j + 1] = 3 - ans[i][j];
        }
      }
      if (i) {
        cnt = 0;
        for (int j = 0; j < m; j++) {
          if (col[i - 1][j] == 'E' && ans[i][j] != ans[i - 1][j] ||
              col[i - 1][j] == 'N' && ans[i][j] == ans[i - 1][j])
            cnt++;
        }
        if (cnt * 2 > m) {
          for (int j = 0; j < m; j++) ans[i][j] = 3 - ans[i][j];
        }
      }
    }
  } else {
    for (int j = 0; j < m; j++) {
      ans[0][j] = 1;
      for (int i = 0; i < n - 1; i++) {
        if (col[i][j] == 'E') {
          ans[i + 1][j] = ans[i][j];
        } else {
          ans[i + 1][j] = 3 - ans[i][j];
        }
      }
      if (j) {
        cnt = 0;
        for (int i = 0; i < n; i++) {
          if (row[i][j - 1] == 'E' && ans[i][j - 1] != ans[i][j] ||
              row[i][j - 1] == 'N' && ans[i][j - 1] == ans[i][j])
            cnt++;
        }
        if (cnt * 2 > n) {
          for (int i = 0; i < n; i++) ans[i][j] = 3 - ans[i][j];
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) printsp(ans[i][j]);
    puts("");
  }
  return 0;
}
