#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


//Nの正の約数を列挙する
vector<long long> Divisors(long long N){
    vector<long long> p,q;
    long long i=1,K=0;
    while(i*i<N){
        if(N%i==0){
            p.push_back(i);
            q.push_back(N/i);
            K++;
        }
        i++;
    }
    if(i*i==N) p.push_back(i);
    for(int i=K-1;i>=0;i--){
        p.push_back(q[i]);
    }
    return p;
}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,H;
	cin>>N>>H;
	int W=N/H;
	int D=H;
	auto p=Divisors(N);
	while(D%2==0) D/=2;
	vector<vector<int>> ans(H,vector<int>(W));
	//cout<<D<<" "<<W<<endl;
	if(H==N){
		for(auto x:p){
			if(x==N) return ;
			rep(i,x) cout<<x<<"\n";
		}
	}
	if(D==1){
		int A=0,B=1;
		for(auto x:p){
			if(x==N) continue;
			int y=x;
			if(x%W!=0){
				while(y){
					y--;
					ans[0][A]=x;
					A++;
				}
			}else{
				while(y){
					y-=W;
					rep(i,W) ans[B][i]=x;
					B++;
				}
			}
		}
	}else{
		int A=0,B=1;
		for(auto x:p){
			if(x==N) continue;
			int y=x;
			if(x%H!=0){
				while(y){
					y--;
					ans[A][0]=x;
					A++;
				}
			}else{
				while(y){
					y-=H;
					rep(i,H) ans[i][B]=x;
					B++;
				}
			}
		}
	}
	rep(i,H) vec_out(ans[i]);
}