#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (ll i = j; i < (n); ++i)
#define rrep(i, j, n) for (ll i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}

[[maybe_unused]] constexpr long long MOD = 998244353;
// constexpr long long MOD = 1000000007;
[[maybe_unused]] constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, h;
  cin >> n >> h;
  vector<int> d;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      d.push_back(i);
      if (n / i != i) d.push_back(n / i);
    }
  }
  sort(all(d));
  d.pop_back();
  int l = n / h;
  bool rel = h > l;
  if (rel) swap(l, h);
  // put l * 1 on the top
  vector<int> ans;
  for (int e : d) rep(i, 0, e) ans.push_back(e);
  // if (rel) swap(l, h);
  if (rel) {
    rep(j, 0, l) {
      rep(i, 0, h) cout << ans[i * l + j] << ' ';
      cout << '\n';
    }
  } else
    rep(i, 0, h) {
      rep(j, 0, l) cout << ans[i * l + j] << ' ';
      cout << '\n';
    }
}