#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-5;
const ld pi = acos(-1.0);


void solve() {
	int n, k; cin >> n >> k;
	if (n <= k*k) {
		int sz = sqrt(n+0.01);
		if (sz*sz < n)sz++;
		vector<vector<char>> mp(sz);
		rep(i, sz)mp[i].resize(sz, '.');
		rep(i, sz) {
			rep(j, sz) {
				if (n > 0) {
					mp[i][j] = '#'; n--;
				}
			}
		}
		cout << sz << endl;
		rep(i, sz) {
			rep(j, sz) {
				cout << mp[i][j];
			}
			cout << endl;
		}
		return;
	}
	int sz = (n + k - 1) / k;
	vector<vector<char>> mp(sz);
	rep(i, sz)mp[i].resize(sz, '.');
	rep(i, sz) {
		Rep(j, i, i + k) {
			if (n > 0) {
				mp[i][j%sz] = '#'; n--;
			}
		}
	}
	cout << sz << endl;
	rep(i, sz) {
		rep(j, sz) {
			cout << mp[i][j];
		}
		cout << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(50);
	//init();
	solve();

	//cout << "finish" << endl;
	//stop
		return 0;
}