#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,U;
int H,W,L;
string S[101];
int F[101];
vector<ll> HV[101];
unordered_set<ll> cands;

using VT = string;

struct RollingHash {
	static const ll mo0=1000000021,mo1=1000000009;
	static ll mul0,mul1;
	static const ll add0=1000010007, add1=1003333331;
	static vector<ll> pmo[2];
	VT s; int l; vector<ll> hash_[2];
	void init(VT s) {
		this->s=s; l=s.size(); int i,j;
		hash_[0]=hash_[1]=vector<ll>(1,0);
		if(!mul0) mul0=10009+(((ll)&mul0+time(NULL))>>5)%1259,mul1=10007+(time(NULL)+((ll)&mul1)>>5)%2257;
		if(pmo[0].empty()) pmo[0].push_back(1),pmo[1].push_back(1);
		FOR(i,l) hash_[0].push_back((hash_[0].back()*mul0+add0+s[i])%mo0);
		FOR(i,l) hash_[1].push_back((hash_[1].back()*mul1+add1+s[i])%mo1);
	}
	ll hash(int l,int r) { // s[l..r]
		if(l>r) return 0;
		while(pmo[0].size()<r+2)
			pmo[0].push_back(pmo[0].back()*mul0%mo0), pmo[1].push_back(pmo[1].back()*mul1%mo1);
		return (((hash_[0][r+1]+(mo0-hash_[0][l]*pmo[0][r+1-l]%mo0))%mo0)<<32) | 
			             ((hash_[1][r+1]+(mo1-hash_[1][l]*pmo[1][r+1-l]%mo1))%mo1);
	}
	ll hash(VT s) { init(s); return hash(0,s.size()-1); }
	static ll concat(ll L ,ll R,int RL) { // hash(L+R) RL=len-of-R
		while(pmo[0].size()<RL+2) pmo[0].push_back(pmo[0].back()*mul0%mo0), pmo[1].push_back(pmo[1].back()*mul1%mo1);
		ll La=L>>32,Lb=(L<<32)>>32,Ra=R>>32,Rb=(R<<32)>>32;
		return (((Ra + La*pmo[0][RL])%mo0)<<32)|((Rb + Lb*pmo[1][RL])%mo1);
	}
};
vector<ll> RollingHash::pmo[2]; ll RollingHash::mul0,RollingHash::mul1;
RollingHash rh;
vector<pair<ll,pair<int,int>>> cand;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>U;
	cin>>H>>W;
	L=H*W;
	FOR(i,N) {
		cin>>F[i];
		FOR(y,H) {
			cin>>s;
			S[i]+=s;
		}
		S[i]+="#.";
		rh.init(S[i]);
		ll h=rh.hash(0,L-1);
		HV[i].push_back(h);
		cands.insert(h);
		cand.push_back({h,{i,-1}});
		if(F[i]) {
			FOR(j,L) {
				if(S[i][j]=='#') {
					ll h=rh.concat(rh.hash(0,j-1),rh.hash(L+1,L+1),1);
					h=rh.concat(h,rh.hash(j+1,L-1),L-(j+1));
					HV[i].push_back(h);
					cands.insert(h);
					cand.push_back({h,{i,j}});
				}
				else {
					ll h=rh.concat(rh.hash(0,j-1),rh.hash(L,L),1);
					h=rh.concat(h,rh.hash(j+1,L-1),L-(j+1));
					HV[i].push_back(h);
					cands.insert(h);
					cand.push_back({h,{i,j}});
				}
			}
		}
		sort(ALL(HV[i]));
	}
	FOR(i,1<<min(L,20)) {
		s=string(L,'.');
		FOR(j,min(L,20)) if(i&(1<<j)) s[j]='#';
		auto h=rh.hash(s);
		if(cands.count(h)==0) {
			S[N]=s;
			cand.push_back({h,{N,-1}});
			break;
		}
	}
	sort(ALL(cand));
	reverse(ALL(cand));
	int ret=-1010;
	pair<int,int> rs;
	FORR2(h,s,cand) {
		int val=0;
		FOR(i,N) {
			while(HV[i].size()&&HV[i].back()>h) HV[i].pop_back();
			if(HV[i].size()&&HV[i].back()==h) {
				if(i<U) val++;
				if(i>=U) val--;
			}
		}
		if(chmax(ret,val)) {
			rs=s;
		}
	}
	cout<<ret<<endl;
	s=S[rs.first];
	x=rs.second;
	if(x>=0) s[x]='#'+'.'-s[x];
	
	FOR(y,H) {
		FOR(x,W) cout<<s[y*W+x];
		cout<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}