#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint1000000007;
#define rep(i,n) for (ll i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int n,h;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>h;
    int p;
    if(n==6)p=3;
    else if(n==28)p=7;
    else if(n==496)p=31;
    else p=127;
    bool f=true;
    if(h%p!=0){
        h=n/h;
        f=false;
    }
    vector<vector<int>>A(h,vector<int>(n/h));
    int q=h,at=0;
    while(q<n){
        rep(i,h){
            rep2(j,at,at+q/h){
                A[i][j]=q;
            }
        }
        at+=q/h;
        q*=2;
    }
    at=0;
    rep2(k,1,h){
        if(n%k==0){
            rep2(i,at,at+k){
                A[i][n/h-1]=k;
            }
            at+=k;
        }
    }
    if(f){
        rep(i,h){
            rep(j,n/h)cout<<(A[i][j])<<" ";
            cout<<"\n";
        }
    }else{
        rep(i,n/h){
            rep(j,h)cout<<(A[j][i])<<" ";
            cout<<"\n";
        }
    }
}