#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
struct trie{
    vector<int>parent,position;
    vector<map<char,int>>children;
    trie():parent({-1}),children(1){}
    int add_string(string S){
        int v=0;
        for(char c:S){
            auto it=children[v].find(c);
            int nv;
            if(it==children[v].end()){
                nv=parent.size();
                children[v][c]=nv;
                children.emplace_back(map<char,int>());
                parent.emplace_back(v);
            }
            else nv=(*it).second;
            v=nv;
        }
        position.emplace_back(v);
        return v;
    }
};
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,U;cin>>N>>U;
  ll H,W;cin>>H>>W;
  ll L=H*W;
  vector<string>A(N);
  vl F(N);
  rep(i,0,N){
  	cin>>F[i];
  	rep(j,0,H){string S;cin>>S;A[i]+=S;}
  }
  trie T;
  vl Q;
  rep(i,0,N)Q.emplace_back(T.add_string(A[i]));
  vector<string>B=A;
  rep(i,0,N)rep(j,0,L){
  	A[i][j]='#'+'.'-A[i][j];
  	Q.emplace_back(T.add_string(A[i]));
  	A[i][j]='#'+'.'-A[i][j];
  }
  string BB(L,'.');
  rep(i,0,1<<min(20ll,L)){
  	rep(j,0,min(20ll,L))BB[j]=((i>>j)%2?'.':'#');
  	Q.emplace_back(T.add_string(BB));
  }
  sort(all(Q));
  Q.erase(unique(all(Q)),Q.end());
  vl score(Q.back()+1);
  rep(i,0,N){
  	ll u=(i<U?1:-1);
  	ll q=T.add_string(A[i]);
  	score[q]+=u;
  	if(!F[i])continue;
  	rep(j,0,L){
	  	A[i][j]='#'+'.'-A[i][j];
	  	q=T.add_string(A[i]);
	  	score[q]+=u;
	  	A[i][j]='#'+'.'-A[i][j];
  	}
  }
  ll ans=-1e18,qq=-1;
  for(auto q:Q)if(chmax(ans,score[q]))qq=q;
  cout<<ans<<endl;
  BB="";
  while(qq){
  	ll par=T.parent[qq];
  	for(auto[k,v]:T.children[par])if(v==qq)BB+=k;
  	qq=par;
  }
  reverse(all(BB));
  rep(i,0,L)cout<<BB[i]<<(i%W==W-1?"\n":"");
  return 0;
}