#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n, k;std::cin >> n >> k;
  // ###
  // ###
  // ###
  ll m = (n/(k*k)) * k;
  ll ad = (n%(k*k));
  ll x = 0;
  for(int i=0;i<=k;i++){
    if(i*i>=ad){
      x = i;
      break;
    }
  }
  std::cout << m + x << '\n';
  vvl d = VV(m+x, m+x, 0, ll);
  for(int i=0;i<m/k;i++){
    ll st = k*i;
    for(int j=0;j<k;j++){
      for(int l=0;l<k;l++){
        d[st+j][st+l] = 1;
      }
    }
  }
  ll st = k*(m/k);
  for(int i=0;i<x;i++){
    for(int j=0;j<x;j++){
      if(ad){
        d[st+i][st+j] = 1;
        ad--;
      }
    }
  }

  re(i, m+x){
    re(j, m+x){
      std::cout << (d[i][j]?'#':'.') << (j==m+x-1?"\n":"");
    }
  }
  return 0;
}