#include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a); i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define pconent(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const ll MOD =  1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";
const ll MN = 1e5+10;
#define pos(v) ((v) << 1)
#define neg(v) (pos(v) ^ 1)
char ans[100][100],dir[MN] ;
//  0 - white inside black
//  1 - black inside white
void white()
{
    FOR(i,0,50)
    {
        FOR(j,0,100)
        {
            ans[i][j] = '.' ;
        }
    }
}
void black()
{
    FOR(i,50,100)
    {
        FOR(j,0,100)
        {
            ans[i][j] = '#' ;
        }
    }
}
void wib(ll x,ll y)
{
    FOR(i,x,x+3)
    {
        FOR(j,y,y+3)
        {
            ans[i][j] = '#' ;
        }
    }
    ans[x+1][y+1] = '.' ;
}
void biw(ll x,ll y)
{
    FOR(i,x,x+3)
    {
        FOR(j,y,y+3)
        {
            ans[i][j] = '.' ;
        }
    }
    ans[x+1][y+1] = '#' ;
}
void output()
{
    ll a,b ;
    cin>>a>>b ;
    black() ;
    white() ;
    a-- ;
    b-- ;
    for(ll i = 0 ; i<50 ; i+=2)
    {
        for(ll j = 0 ; j<100 ; j+=2)
        {
            if(b==0)
            {
                break ;
            }
            ans[i][j] = '#' ;
            b-- ;
        }
        if(b==0)
        {
            break ;
        }
    }
    for(ll i = 51 ; i<100 ; i+=2)
    {
        for(ll j = 0 ; j<100 ; j+=2)
        {
            if(a==0)
            {
                break ;
            }
            ans[i][j] = '.' ;
            a-- ;
        }
        if(a==0)
        {
            break ;
        }
    }
    cout<<100<<" "<<100<<endl ;
    FOR(i,0,100)
    {
        FOR(j,0,100)
        {
            cout<<ans[i][j] ;
        }
        cout<<endl ;
    }
}
int main()
{
	 #ifdef LOCAL_PROJECT
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif	
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t = 1  ;
    // cin>>t ;
    FOR(i,0,t)
    {
        output() ;
    }
    return 0 ;
}

Measured memory_bytes: 256