#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; typedef long double ld; const int inf=1e9+7; const ll longinf=1LL<<60 ; const ll mod=1e9+7 ; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair P; typedef pair LDP; typedef pair LP; #define fr first #define sc second #define all(c) c.begin(),c.end() #define pb push_back #define debug(x) cout << #x << " = " << (x) << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } //#define int long long void solve() { int n, k, m; cin >> n >> k; char s[1010][1010]; if(n >= k * k) { m = n / k; int cnt = 0; rep(i, m) { rep(j, m) { s[i][j] = '.'; } } rep(i, m) { for(int j = i; j < i + k; j++) { if(cnt < n) { s[i][j % m] = '#'; cnt ++; } } } } else { m = (int)ceil(sqrt(n)); int cnt = 0; rep(i, m) { rep(j, m) { if(cnt < n) { s[i][j] = '#'; cnt ++; } else { s[i][j] = '.'; } } } } rep(i, m) { rep(j, m) { cout << s[i][j]; } cout << endl; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(10); //init(); solve(); //cout << "finish" << endl; return 0; }