#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

int main(){
    ll n, h;
    cin >> n >> h;

    //できるだけ平に詰める.
    set<ll> d;
    for(ll i=1; i<=n-1; i++) if(n%i == 0) d.insert(-i);

    ll si = 0;
    ll sj = 0;
    ll w = n/h;
    vector<vector<ll>> ans(h, vector<ll>(w, 0));
    while((ll)d.size() != 0){
        vector<ll> e_cand;
        for(auto itr=d.begin(); itr!=d.end(); itr++){
            if((-(*itr))%(h-si) == 0){
                rep(j, (ll)(-(*itr)) / (h - si)){
                    for(ll k=si; k<h; k++){
                        ans[k][sj] = (-(*itr));
                    }
                    sj++;
                }
                e_cand.pb((*itr));
            }else if((-(*itr))%(w-sj) == 0){
                rep(j, (ll)(-(*itr))/(w-sj)){
                    for(ll k=sj; k<w; k++){
                        ans[si][k] = (-(*itr));
                    }
                    si++;
                }
                e_cand.pb((*itr));
            }
        }

        for(ll x : e_cand){
            d.erase(x);
        }
    }

    rep(i, h){
        rep(j, w) cout << ans[i][j] << " ";
        cout << endl;
    }
}