#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N, K;

int main() {
  for (; ~scanf("%d%d", &N, &K); ) {
    const int R = K - (K - 1) / 4 * 4;
    vector<int> ds(K);
    switch (R) {
      case 1: ds[0] = +1; break;
      case 2: ds[0] = +2; ds[1] = -1; break;
      case 3: ds[0] = +4; ds[1] = -2; ds[2] = -1; break;
      case 4: ds[0] = +5; ds[1] = +1; ds[2] = -3; ds[3] = -2; break;
      default: assert(false);
    }
    for (int i = 0; i < K - R; ++i) {
      ds[R + i] = ((i % 4 == 1 || i % 4 == 2) ? -1 : +1) * (6 + i);
    }
// cerr<<"ds = "<<ds<<endl;
    
    int u = 0;
    for (int t = 1; t < N; ++t) {
      for (int k = 0; k < K; ++k) {
        u += ds[k];
        for (; u >= N; u -= N) {}
        for (; u < 0; u += N) {}
        if (t > 1 || k > 0) printf(" ");
        printf("%d", u + 1);
      }
      assert(u == t);
    }
    puts("");
  }
  return 0;
}