#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
ll MOD = 1000000007;
ll INFL = 1ll << 60;
ll INF = 1 << 28;

// ====================================================================

int main() {
  int n, k;
  cin >> n >> k;
  bool v[1010][1010];
  for (int i = 0; i < 1010; i++)
    for (int j = 0; j < 1010; j++)
      v[i][j] = false;

  bool end = false;
  int count = 0, ny = 0, nx = 0, lx, ly;
  for (int i = 0; true; i++) {
    for (int y = 0; y < k; y++) {
      for (int x = 0; x < k; x++) {
        v[ny + y][nx + x] = true;
        count++;
        if (count >= n) {
          end = true;
          ly = ny + y, lx = nx + x;
          break;
        }
      }
      if (end) break;
    }
    if (end) break;
    ny += k, nx += k;
  }

  int m = max(ly + 1, lx + 1);
  cout << m << endl;
  for (int y = 0; y < m; y++) {
    for (int x = 0; x < m; x++) {
      cout << ((v[y][x]) ? '#' : '.');
    }
    cout << endl;
  }
}