use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input! {
        n: usize,
        u: usize,
        h: usize,
        w: usize,
        grid: [(i32, [bytes; h]); n],
    }
    let hash = (0..h).map(|_| (0..w).map(|_| rand() * 3 + 1).collect::<Vec<_>>()).collect::<Vec<_>>();
    let calc = |g: &[Vec<u8>]| -> usize {
        let mut v = 0;
        for (h, g) in hash.iter().zip(g.iter()) {
            for (h, g) in h.iter().zip(g.iter()) {
                if *g == b'#' {
                    v ^= *h;
                }
            }
        }
        v
    };
    let mut dp = Map::new();
    for (i, &(f, ref g)) in grid.iter().enumerate() {
        let val = calc(g);
        let po = dp.entry(val).or_insert((i, h, w, 0));
        if i < u {
            po.3 += 1;
        } else {
            po.3 -= 1;
        }
        if f == 1 {
            for x in 0..h {
                for y in 0..w {
                    let val = val ^ hash[x][y];
                    let po = dp.entry(val).or_insert((i, x, y, 0));
                    if i < u {
                        po.3 += 1;
                    } else {
                        po.3 -= 1;
                    }
                }
            }
        }
    }
    let mut memo = vec![];
    let mut p = vec![b'.'; h * w];
    let mut key = 0;
    loop {
        if !dp.contains_key(&key) {
            dp.insert(key, (n, 0, 0, 0));
            memo = p.chunks_exact(w).map(|p| Vec::from(p)).collect::<Vec<_>>();
            break;
        }
        if let Some(x) = p.iter().position(|p| *p == b'.') {
            p[x] = b'#';
            p[..x].fill(b'.');
            for h in hash.iter().flatten().take(x + 1) {
                key ^= *h;
            }
        } else {
            break;
        }
    }
    let (k, i, j, v) = *dp.values().max_by_key(|p| p.3).unwrap();
    let mut ans = memo;
    if k < n {
        ans = grid[k].1.clone();
        if i < h && j < w {
            ans[i][j] ^= b'#' ^ b'.';
        }
    }
    println!("{}", v);
    for g in ans.iter() {
        println!("{}", g.iter().map(|g| *g as char).collect::<String>());
    }
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
fn rand_memory() -> usize {
    Box::into_raw(Box::new("I hope this is a random number")) as usize
}

fn rand() -> usize {
    static mut X: usize = 0;
    unsafe {
        if X == 0 {
            X = rand_memory();
        }
        X ^= X << 13;
        X ^= X >> 17;
        X ^= X << 5;
        X
    }
}

fn shuffle<T>(a: &mut [T]) {
    for i in 1..a.len() {
        let p = rand() % (i + 1);
        a.swap(i, p);
    }
}