#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

vector<int> dh={0,1,0,-1},dw={1,0,-1,0};

int N=7,H=4,W=4;
char S[20][20];

void DFS(int h,int w,int cn){
    //cout<<h<<" "<<w<<" "<<cn<<endl;
    if(h==H){
        bool ok=true;
        for(int i=0;i<H;i++){
            for(int j=0;j<W;j++){
                if(S[i][j]=='.') continue;
                int cn=0;
                for(int k=0;k<4;k++){
                    int toh=i+dh[k],tow=j+dw[k];
                    toh=(toh+H)%H;
                    tow=(tow+W)%W;
                    if(S[toh][tow]=='#') cn++;
                }
                if(cn!=3){
                    return;
                }
            }
        }
        int X=0;
        for(int i=0;i<H;i++) for(int j=0;j<W;j++) if(S[i][j]=='#') X++;
        if(ok&&X==H*W/2){
            for(int i=0;i<H;i++){
                cout<<S[i]<<"\n";
            }
            cout<<"\n";
        }
        
        return;
    }
    
    if(w==W){
        if(1) DFS(h+1,0,0);
        return;
    }
    
    if(1){
        S[h][w]='#';
        bool ok=true;
        
        if(h>=2){
            int i=h-1,j=w;
            
            if(S[i][j]=='#'){
                int cn=0;
                for(int k=0;k<4;k++){
                    int toh=i+dh[k],tow=j+dw[k];
                    toh=(toh+H)%H;
                    tow=(tow+W)%W;
                    if(S[toh][tow]=='#') cn++;
                }
                if(cn!=3){
                    ok=false;
                }
            }
            
            
        }
        
        if(ok) DFS(h,w+1,cn+1);
    }
    
    if(1){
        S[h][w]='.';
        bool ok=true;
        
        if(h>=2){
            int i=h-1,j=w;
            
            if(S[i][j]=='#'){
                int cn=0;
                for(int k=0;k<4;k++){
                    int toh=i+dh[k],tow=j+dw[k];
                    toh=(toh+H)%H;
                    tow=(tow+W)%W;
                    if(S[toh][tow]=='#') cn++;
                }
                if(cn!=3){
                    ok=false;
                }
            }
            
        }
        
        if(ok) DFS(h,w+1,cn);
    }
    
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
   // DFS(0,0,0);
    /*
    
    for(int i=0;i<18;i++){
        cout<<"cout<<"<<'"';
        string X;cin>>X;
        cout<<X;
        cout<<'\\';
        cout<<'n';
        cout<<'"';
        cout<<';';
        cout<<endl;
    }
    
    DFS(0,0,0);
    
    return 0;
    
    for(int H=7;H<=7;H++){
        for(int W=H;W<=7;W++){
            if((H*W)%7) continue;
            vector<int> P(H*W);
            for(int i=H*W/7*2;i<H*W;i++) P[i]=1;
            do{
                vector<string> S(H,string(W,'.'));
                for(int i=0;i<H*W;i++){
                    if(P[i]) S[i/W][i%W]='#';
                }
                bool ok=true;
                for(int i=0;i<H;i++){
                    for(int j=0;j<W;j++){
                        if(S[i][j]=='.') continue;
                        int cn=0;
                        for(int k=0;k<4;k++){
                            int toh=i+dh[k],tow=j+dw[k];
                            toh=(toh+H)%H;
                            tow=(tow+W)%W;
                            if(S[toh][tow]=='#') cn++;
                        }
                        if(cn!=3){
                            ok=false;
                            break;
                        }
                    }
                }
                
                if(ok){
                    for(int i=0;i<H;i++){
                        cout<<S[i]<<"\n";
                    }
                    cout<<"\n";
                }
            }while(next_permutation(all(P)));
        }
    }
    */
    int P,Q;cin>>P>>Q;
    int H,W;
    
    auto putX=[&](){
        cout<<H<<" "<<W<<endl;
        for(int j=0;j<W;j++){
            if(j==0||j==W-1) cout<<'.';
            else cout<<'#';
        }
        cout<<endl;
        for(int j=0;j<W;j++){
            if(j==0||j==1||j==W-2||j==W-1) cout<<'#';
            else cout<<'.';
        }
        cout<<endl;
        for(int j=0;j<W;j++){
            if(j==0||j==1||j==W-2||j==W-1) cout<<'#';
            else cout<<'.';
        }
        cout<<endl;
        for(int j=0;j<W;j++){
            if(j==0||j==W-1) cout<<'.';
            else cout<<'#';
        }
        cout<<endl;
        exit(0);
    };
    
    if(P==0){
        cout<<1<<" "<<1<<endl;
        cout<<'.'<<endl;
        return 0;
    }
    if(P==1){
        if(Q==1){
            cout<<-1<<" "<<-1<<endl;
            return 0;
        }
        if(Q==2){
            cout<<4<<" "<<4<<endl;
            cout<<"....\n";
            cout<<"....\n";
            cout<<"####\n";
            cout<<"####\n";
            
            return 0;
        }
    }
    if(P==2){
        if(Q==3){
            H=4;W=6;
            putX();
        }
    }
    if(P==3){
        if(Q==4){
            cout<<4<<" "<<4<<endl;
            cout<<"..##\n";
            cout<<"####\n";
            cout<<"##..\n";
            cout<<"####\n";
            return 0;
        }
        if(Q==5){
            H=4;W=10;
            putX();
        }
    }
    if(P==4){
        if(Q==5){
            cout<<5<<" "<<5<<endl;
            cout<<".####\n";
            cout<<"##.##\n";
            cout<<"####.\n";
            cout<<"#.###\n";
            cout<<"###.#\n";
            return 0;
        }
        if(Q==7){
            H=4;W=14;
            putX();
        }
    }
    if(P==5){
        if(Q==7){
            cout<<10<<" "<<7<<endl;
            cout<<"#######\n";
            cout<<"####...\n";
            cout<<"#..####\n";
            cout<<"#..####\n";
            cout<<"####...\n";
            cout<<"#######\n";
            cout<<"....###\n";
            cout<<"#####.#\n";
            cout<<"#####.#\n";
            cout<<"....###\n";
            return 0;
        }
        if(Q==8){
            H=4;W=8;
            putX();
        }
        if(Q==9){
            H=4;W=18;
            putX();
        }
    }
    if(P==7){
        if(Q==9){
            cout<<18<<" "<<6<<endl;
            cout<<"#####.\n";
            cout<<"###.##\n";
            cout<<"..####\n";
            cout<<"####.#\n";
            cout<<"##.###\n";
            cout<<".####.\n";
            cout<<"###.##\n";
            cout<<"#.####\n";
            cout<<"####..\n";
            cout<<"##.###\n";
            cout<<".#####\n";
            cout<<"###..#\n";
            cout<<"#.####\n";
            cout<<"#####.\n";
            cout<<"##..##\n";
            cout<<".#####\n";
            cout<<"####.#\n";
            cout<<"#..###\n";
            return 0;
        }
        if(Q==10){
            H=4;W=5;
            putX();
        }
    }
    
    if(3*P<=2*Q){
        cout<<2*Q<<" "<<4<<endl;
        for(int i=0;i<P;i++){
            cout<<"####\n";
            cout<<"####\n";
            cout<<"....\n";
        }
        for(int i=0;i<2*(Q-P)-P;i++){
            cout<<"....\n";
        }
        return 0;
    }
    
    if((2*Q)%P==0){
        int X=2*Q/P;
        cout<<X<<" "<<4<<endl;
        for(int i=0;i<2;i++) cout<<"####\n";
        for(int i=0;i<X-2;i++) cout<<"....\n";
        return 0;
    }
    
    cout<<-1<<" "<<-1<<endl;
    
}