/** * author: shu8Cream * created: 24.06.2022 21:43:54 **/ #include using namespace std; #define overload3(a,b,c,d,...) d #define rep1(i,n) for (int i=0; i<(n); i++) #define rep2(i,a,n) for (int i=(a); i<(n); i++) #define rep(...) overload3(__VA_ARGS__, rep2, rep1)(__VA_ARGS__) #define rrep1(i,n) for (int i=(n-1); i>=0; i--) #define rrep2(i,a,n) for (int i=(n-1); i>=(a); i--) #define rrep(...) overload3(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) int((x).size()) #define pcnt __builtin_popcountll using ll = long long; using P = pair; template using vc = vector; template using vv = vc>; using vi = vc; using vvi = vv; const ll INF = 8e18; templateistream& operator>>(istream&i,vc&v){rep(j,sz(v))i>>v[j];return i;} templatestring join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<ostream& operator<<(ostream&o,const vc&v){if(sz(v))o<istream& operator>>(istream&i,pair&v){return i>>v.first>>v.second;} templateostream& operator<<(ostream&o,const pair&v){return o< inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template string to_string(T s); template string to_string(pair p); string to_string(char c) { return string(1, c); } string to_string(string s) { return s; } string to_string(const char s[]) { return string(s); } template string to_string(T v) { if (v.empty()) return "{}"; string ret = "{"; for (auto x : v) ret += to_string(x) + ","; ret.back() = '}'; return ret; } template string to_string(pair p) { return "{" + to_string(p.first) + ":" + to_string(p.second) + "}"; } void debug_out() { cout << endl; } template void debug_out(Head H, Tail... T) { cout << to_string(H) << " "; debug_out(T...); } #ifdef _DEBUG #define debug(...) debug_out(__VA_ARGS__) #else #define debug(...) #endif vi divisor(ll n){ vi res; for(ll i=1; i*i<=n; i++){ if(n%i==0){res.push_back(i); if(i*i!=n) res.push_back(n/i);} } sort(all(res)); return res; } void rot90(vvi &a){ int h = sz(a), w = sz(a[0]); vvi pre(w,vi(h)); swap(a,pre); rep(i,w)rep(j,h) a[i][j] = pre[h-1-j][i]; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); int n,h; cin >> n >> h; int w = n/h; bool odd = false; vi div = divisor(n); int it = lower_bound(all(div),h) - div.begin(); if(sz(div)/2<=it){ swap(h,w); odd = true; } vvi ans(h,vi(w)); int cur = 0; for(auto p :div){ if(p==n) break; rep(i,p){ int x = cur%w; int y = cur/w; ans[y][x] = p; cur++; } } if(odd){ rot90(ans); swap(h,w); } rep(i,h) cout << ans[i] << endl; }