#![allow(unused_macros)]
#![allow(unused_mut)]
#![allow(non_snake_case)]
#![allow(unused_variables)]
#![allow(unused_imports)]
//
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
//
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($y: expr),+) => (::std::cmp::max($x, max!( $($y),+)));
}

macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($y: expr),+) => (::std::cmp::min($x, min!( $($y),+)));
}

// solution 
use std::cmp;
use std::collections::{HashMap, HashSet, BTreeMap, BTreeSet};
fn main() {
    input! {
        A: usize,
        B: usize,
    }

    let K = 50;
    let mut grid = vec![vec![false; 2*K]; 2*K];
    for row in 0..K {
        for col in 0..2*K {
            grid[row][col] = true;
        }
    }

    'outer: for row in 1..K {
        for col in 1..2*K-1 {
            if A-1 == 0 {
                break 'outer;
            } else if grid[row-1][col-1] && grid[row-1][col] && grid[row][col-1] && 
                grid[row+1][col+1] && grid[row+1][col] && grid[row][col+1] &&
                    grid[row+1][col-1] && grid[row-1][col-1] {
                grid[row][col] = false;
                A -= 1;
            }
        }
    }

    'outer: for row in K+1..2*K-1 {
        for col in 1..2*K-1 {
            if B-1 == 0 {
                break 'outer;
            } else if !(grid[row-1][col-1] || grid[row-1][col] || grid[row][col-1] ||
                        grid[row+1][col+1] || grid[row+1][col] || grid[row][col+1] ||
                        grid[row+1][col-1] || grid[row-1][col+1]) {
                grid[row][col] = true;;
                B -= 1;
            }
        }
    }
    
    println!("100 100");
    for row in 0..2*K {
        for col in 0..2*K {
            if grid[row][col] {
                print!("#");
            } else {
                print!(".");
            }
        }
        print!("\n");
    }
}


Measured memory_bytes: 4352