#include <bits/stdc++.h>
using namespace std;
int h, w, k;
vector<string> c;
void solve_one_color() {
  int total_c = 2 * h * w - h - w;
  int eq = 0;
  for (const auto& e : c) {
    for (const auto& p : e)
      if (p == 'E') ++eq;
  }
  if (eq < static_cast<long double>(total_c) * 3 / 4) {
    cout << "NO";
    return;
  }
  cout << "YES\n";
  for (int i = 0; i < h; ++i) {
    for (int j = 0; j < w; ++j) {
      cout << "1 ";
    }
    cout << '\n';
  }
}
void solve_many_colors_w_more_or_eq_h() {
  vector<vector<int>> ans(h, vector<int>(w));
  for (int i = 0; i < h; ++i) {
    ans[i][0] = 1;
    for (int j = 1; j < w; ++j) {
      ans[i][j] = (c[i * 2][j - 1] == 'E' ? ans[i][j - 1] : 3 - ans[i][j - 1]);
    }
    if (i == 0) continue;
    int ok = 0;
    for (int j = 0; j < w; ++j) {
      if (ans[i][j] == ans[i - 1][j] && c[(i - 1) * 2 + 1][j] == 'E')
        ++ok;
      else if (ans[i][j] != ans[i - 1][j] && c[(i - 1) * 2 + 1][j] == 'N')
        ++ok;
    }
    if (ok < w - ok) {
      for (int j = 0; j < w; ++j) ans[i][j] = 3 - ans[i][j];
    }
  }
  cout << "YES\n";
  for (const auto& e : ans) {
    for (const auto& p : e) cout << p << ' ';
    cout << '\n';
  }
}
void solve_many_colors_w_less_than_h() {
  vector<vector<int>> ans(h, vector<int>(w));
  for (int j = 0; j < w; ++j) {
    ans[0][j] = 1;
    for (int i = 1; i < h; ++i) {
      ans[i][j] = (c[i * 2 - 1][j] == 'E' ? ans[i - 1][j] : 3 - ans[i - 1][j]);
    }
    if (j == 0) continue;
    int ok = 0;
    for (int i = 0; i < h; ++i) {
      if (ans[i][j] == ans[i][j - 1] && c[i * 2][j - 1] == 'E')
        ++ok;
      else if (ans[i][j] != ans[i][j - 1] && c[i * 2][j - 1] == 'N')
        ++ok;
    }
    if (ok < h - ok) {
      for (int i = 0; i < h; ++i) ans[i][j] = 3 - ans[i][j];
    }
  }
  cout << "YES\n";
  for (const auto& e : ans) {
    for (const auto& p : e) cout << p << ' ';
    cout << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> h >> w >> k;
  c.resize(2 * h - 1);
  for (int i = 0; i < 2 * h - 1; ++i) {
    cin >> c[i];
  }
  if (k == 1) {
    solve_one_color();
    return 0;
  }
  if (w >= h)
    solve_many_colors_w_more_or_eq_h();
  else
    solve_many_colors_w_less_than_h();
  return 0;
}
