#include <bits/stdc++.h>
#include <random>
#include <string>
#include <unordered_map>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  int N, U, H, W;
  cin >> N >> U >> H >> W;
  mt19937_64 rd(222);
  vector<ull> A(H * W);
  rep(i, H * W) A[i] = rd();
  unordered_map<ull, ll> cnt;
  unordered_map<ull, pii> grididx;
  vector<string> Grid(N);
  rep(idx, N) {
    int F;
    cin >> F;
    ull h = 0;
    rep(H) {
      string S;
      cin >> S;
      Grid[idx] += S;
    }
    rep(i, H * W) {
      if (Grid[idx][i] == '#')
        h ^= A[i];
    }
    cnt[h] += idx < U ? 1 : -1;
    grididx[h] = pii{idx, -1};
    if (F) {
      rep(i, H * W) {
        string S = Grid[idx];
        S[i] ^= '.' ^ '#';
        h ^= A[i];
        cnt[h] += idx < U ? 1 : -1;
        grididx[h] = pii{idx, i};
        h ^= A[i];
      }
    }
  }
  ll ans = -N;
  int ansidx = 0, ansp = -1;
  for (auto [h, v] : cnt) {
    if (chmax(ans, v)) {
      ansidx = grididx[h].first;
      ansp = grididx[h].second;
    }
  }
  string ansS = Grid[ansidx];
  if (ansp >= 0)
    ansS[ansp] ^= '.' ^ '#';
  if (ans < 0) {
    rep(i, 1 << min(H * W, 24)) {
      ull h = 0;
      rep(j, min(H * W, 24)) {
        if (i >> j & 1)
          h ^= A[j];
      }
      if (!cnt.contains(h)) {
        ans = 0;
        ansS = string(H * W, '.');
        rep(j, min(H * W, 24)) {
          if (i >> j & 1)
            ansS[j] ^= '.' ^ '#';
        }
        break;
      }
    }
  }

  cout << ans << '\n';
  rep(i, H) {
    rep(j, W) { cout << ansS[i * W + j]; }
    cout << '\n';
  }
}