#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int> DivisorEnumeration(int n) {
	vector<int> x;
	for (int i = 1; i*i <= n; i++) {
		if (0 == n % i) {
			x.push_back(i);
			if (n != i * i) x.push_back(n / i);
		}
	}
	sort(all(x));
	return x;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, h; cin >> n >> h;
	int w = n / h;
	auto v = DivisorEnumeration(n);
	v.pop_back();
	vector<int> memo;
	rep(i, v.size()) rep(j, v[i])memo.push_back(v[i]);
	vector<vector<int>> ans(min(h, w), vector<int>(max(h, w)));
	rep(i, ans.size()) {
		rep(j, ans[i].size()) {
			ans[i][j] = memo[i * ans[i].size() + j];
		}
	}
	if (h < w) {
		rep(i, ans.size()) {
			rep(j, ans[i].size()) {
				cout << ans[i][j] << " ";
			}
			cout << endl;
		}
	}
	else {
		rep(i, ans[0].size()) {
			rep(j, ans.size()) {
				cout << ans[j][i] << " ";
			}
			cout << endl;
		}
	}
	return 0;
}