#include <bits/stdc++.h>
using namespace std;
const int size = 1010;
int maps[size][size];
char hor[size][size], ver[size][size];
int main() {
  int n, m, k;
  scanf("%d %d %d", &n, &m, &k);
  int i, j;
  for (i = 0; i < 2 * n - 1; i++) {
    if (i & 1)
      scanf("%s", ver[i >> 1]);
    else
      scanf("%s", hor[i >> 1]);
  }
  if (k == 1) {
    int e = 0, sum = 0;
    for (i = 0; i < n; i++) {
      for (j = 0; j < m - 1; j++)
        if (hor[i][j] == 'E')
          e++;
        else
          sum++;
    }
    for (i = 0; i < n - 1; i++) {
      for (j = 0; j < m; j++)
        if (ver[i][j] == 'E')
          e++;
        else
          sum++;
    }
    sum += e;
    if (4 * e >= 3 * sum) {
      puts("YES");
      for (i = 0; i < n; i++) {
        for (j = 0; j < m - 1; j++) printf("1 ");
        printf("1\n");
      }
    } else
      puts("NO");
    return 0;
  }
  puts("YES");
  if ((m - 1) * n >= (n - 1) * m) {
    for (i = 0; i < n; i++) {
      maps[i][0] = 1;
      for (j = 0; j < m - 1; j++) {
        if (hor[i][j] == 'E')
          maps[i][j + 1] = maps[i][j];
        else
          maps[i][j + 1] = 3 - maps[i][j];
      }
      if (i > 0) {
        int yes = 0, no = 0;
        for (j = 0; j < m; j++) {
          if ((maps[i - 1][j] == maps[i][j]) != (ver[i - 1][j] == 'E'))
            no++;
          else
            yes++;
        }
        if (no > yes)
          for (j = 0; j < m; j++) maps[i][j] = 3 - maps[i][j];
      }
    }
  } else {
    for (j = 0; j < m; j++) {
      maps[0][j] = 1;
      for (i = 0; i < n - 1; i++) {
        if (ver[i][j] == 'E')
          maps[i + 1][j] = maps[i][j];
        else
          maps[i + 1][j] = 3 - maps[i][j];
      }
      if (j > 0) {
        int yes = 0, no = 0;
        for (i = 0; i < n; i++) {
          if ((maps[i][j - 1] == maps[i][j]) != (hor[i][j - 1] == 'E'))
            no++;
          else
            yes++;
        }
        if (no > yes)
          for (i = 0; i < n; i++) maps[i][j] = 3 - maps[i][j];
      }
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < m - 1; j++) printf("%d ", maps[i][j]);
    printf("%d\n", maps[i][j]);
  }
  return 0;
}
