#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; ll MOD = 1000000007; typedef pair P; string grid[1010][1010]; int main() { ios::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; if (n <= k * k) { ll ans = 1, t = 1; for (int i = 1; i < k + 1; i++) { if (i * i >= n) { ans = i; break; } } cout << ans << endl; ll cnt = 0; for (int i = 0; i < ans; i++) { for (int j = 0; j < ans; j++) { if (cnt < n) { cout << "#"; } else { cout << "."; } cnt++; } cout << endl; } } else { int t = k * k, ans = k; while (true) { if (n - t <= k * k) { break; } ans += k; t += k * k; } int x = 1; while (true) { if ((n - t) <= x * x) { ans += x; break; } x += 1; } cout << ans << endl; for (int i = 0; i < ans; i++) { for (int j = 0; j < ans; j++) { grid[i][j] = "."; } } ll cnt = 0; for (int i = 0; i < ans; i = i + k) { if (ans - i < k) { for (int a = i; a < x + i; a++) { for (int b = i; b < x + i; b++) { if (cnt < n) { grid[a][b] = "#"; } cnt++; } } } else { for (int a = i; a < k + i; a++) { for (int b = i; b < k + i; b++) { if (cnt < n) { grid[a][b] = "#"; } cnt++; } } } } for (int i = 0; i < ans; i++) { for (int j = 0; j < ans; j++) { cout << grid[i][j]; } cout << endl; } } }