#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<cstring>
#include<bitset>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<numeric>
#include<set>
#include<math.h>
using namespace std;

const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

#define rep(i,x) for(int i=0;i<x;i++)
#define re(i,x,y) for(int i=x;i<y;i++)

long long INF=1e9;
const long long mod=2019;
#define ll long long

int main(){
    cin.tie(0); ios::sync_with_stdio(false);
    int n,k; cin>>n>>k;
    int num=1,x;
    if(n<k*k){
        while(num*num<n){
            num++;
        }
        x=num;
    }
    else if(n%(k*k)==0){
        num=n/(k*k);
        x=num*k;
    }
    else{
        num=n/(k*k)+1;
        x=num*k;
    }    
    cout<<x<<endl;
    vector<vector<char> >a(x,vector<char>(x,'.'));
    int u=k,v=0;
    rep(i,x){
        if(i%k==0&&i>0)v=k,k+=u;
        rep(j,x){
            if(v<=i&&i<k&&v<=j&&j<k&&n>0){
                a[i][j]='#';
                n--;
            }
        }
    }
    rep(i,x){
        rep(j,x){
            cout<<a[i][j];
        }
        cout<<endl;
    }
    return 0;
}