#include <bits/stdc++.h>
using namespace std;
const int MAXN = (1 << 10);
int n, m, k;
string ver[MAXN], hor[MAXN];
void read() {
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> ver[i];
    if (i < n - 1) cin >> hor[i];
  }
}
int a[MAXN][MAXN];
void solve_by_n() {
  int sum = 0;
  for (int i = 0; i < n; i++) {
    a[i][0] = 1;
    for (int j = 1; j < m; j++)
      if (ver[i][j - 1] == 'E')
        a[i][j] = a[i][j - 1];
      else
        a[i][j] = a[i][j - 1] ^ 1;
    sum += m - 1;
    if (i != 0) {
      int cnt = 0;
      for (int j = 0; j < m; j++)
        if (hor[i - 1][j] == 'E' && a[i][j] == a[i - 1][j])
          cnt++;
        else if (hor[i - 1][j] == 'N' && a[i][j] != a[i - 1][j])
          cnt++;
      sum += max(cnt, m - cnt);
      if (cnt < (m - cnt))
        for (int j = 0; j < m; j++) a[i][j] ^= 1;
    }
  }
  if (4 * sum < 3 * (n * (m - 1) + (n - 1) * m)) {
    return;
  }
  cout << "YES" << '\n';
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cout << a[i][j] + 1 << " \n"[j == m - 1];
  exit(0);
}
void solve_by_m() {
  int sum = 0;
  for (int j = 0; j < m; j++) {
    a[0][j] = 1;
    for (int i = 1; i < n; i++)
      if (hor[i - 1][j] == 'E')
        a[i][j] = a[i - 1][j];
      else
        a[i][j] = a[i - 1][j] ^ 1;
    sum += n - 1;
    if (j != 0) {
      int cnt = 0;
      for (int i = 0; i < n; i++)
        if (ver[i][j - 1] == 'E' && a[i][j] == a[i][j - 1])
          cnt++;
        else if (ver[i][j - 1] == 'N' && a[i][j] != a[i][j - 1])
          cnt++;
      sum += max(cnt, n - cnt);
      if (cnt < n - cnt)
        for (int i = 0; i < n; i++) a[i][j] ^= 1;
    }
  }
  if (4 * sum < 3 * (n * (m - 1) + (n - 1) * m)) {
    return;
  }
  cout << "YES" << '\n';
  for (int i = 0; i < n; i++)
    for (int j = 0; j < m; j++) cout << a[i][j] + 1 << " \n"[j == m - 1];
  exit(0);
}
void solve() {
  if (k == 1) {
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      for (char c : ver[i]) cnt += (c == 'E');
      for (char c : hor[i]) cnt += (c == 'E');
    }
    if (4 * cnt < 3 * (n * (m - 1) + (n - 1) * m)) {
      cout << "NO" << '\n';
      return;
    }
    cout << "YES" << '\n';
    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++) cout << 1 << " \n"[j == m - 1];
    return;
  }
  solve_by_n();
  solve_by_m();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  read();
  solve();
  return 0;
}
