#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) x.begin(),x.end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
using namespace std;
using ll=long long;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
int n,m;
inline int num(int x) { return (x-1)%n+1; }
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   Solve();
}
void Solve() {
   cin>>n>>m;
   for(int i=1;i<n;i++) {
      int k=m,j=num(i+13+k);
      for(;k>4;k-=4,j=num(j+4))
         printf("%d %d %d %d ",j,i+1,num(j+2),i);
      switch(k) {
      case 1: printf("%d ",i+1); break;
      case 2: printf("%d %d ",j,i+1); break;
      case 3: printf("%d %d %d ",j,num(j+2),i+1); break;
      case 4: printf("%d %d %d %d ",j,num(j+2),i,i+1); break;
      }
   } puts("");
}