#include <bits/stdc++.h>
using namespace std;

vector<long long> alldiv(long long N) {
	vector<long long> res;
	for (long long i = 1; i * i <= N; ++i) {
		if (N % i == 0) {
			res.push_back(i);
			if (N / i != i) res.push_back(N / i);
		}
	}
	sort(res.begin(), res.end());
	return res;
}

int main() {
	long long N, H;
	cin >> N >> H;

	long long H_ = H;
	while (H_ > 1) {
		if (H_ % 2 == 0) H_ /= 2;
		else break;
	}

	if (H_ == 1) {
		auto a = alldiv(N);
		sort(a.begin(), a.end());
		reverse(a.begin(), a.end());
		vector<vector<long long>> ans(H, vector<long long>(N / H, 0));
		int count = 0, count_ = 0;
		for (int i = 1; i < a.size(); i++) {
			if (a[i] >= N / H) {
				for (int j = 0; j < a[i] / (N / H); j++) {
					for (int k = 0; k < N / H; k++) {
						ans[count][k] = a[i];
					}
					count++;
				}
			}
			else {
				for (int j = 0; j < a[i]; j++) {
					ans[H - 1][count_] = a[i];
					count_++;
				}
			}
		}
		for (int i = 0; i < H; i++) {
			cout << ans[i][0];
			for (int j = 1; j < (N / H); j++) {
				cout << " " << ans[i][j];
			}
			cout << endl;
		}
	}
	else {
		auto a = alldiv(N);
		sort(a.begin(), a.end());
		reverse(a.begin(), a.end());
		vector<vector<long long>> ans(H, vector<long long>(N / H, 0));
		int count = 0, count_ = 0;
		for (int i = 1; i < a.size(); i++) {
			if (a[i] >= H) {
				for (int j = 0; j < a[i] / H; j++) {
					for (int k = 0; k < H; k++) {
						ans[k][count] = a[i];
					}
					count++;
				}
			}
			else {
				for (int j = 0; j < a[i]; j++) {
					ans[count_][(N / H) - 1] = a[i];
                  	count_++;
				}
			}
		}
		for (int i = 0; i < H; i++) {
			cout << ans[i][0];
			for (int j = 1; j < (N / H); j++) {
				cout << " " << ans[i][j];
			}
			cout << endl;
		}
	}
}