// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 400005
#define inf 0x3f3f3f3f

int n,k;
vi res;

vi cons(int k){
	if(k==1)return {1};
	if(k==2)return {-1,2};
	vi o;
	int sum=0;
	For(i,1,k){
		sum+=i;
		o.pb(i);
	}
	if(sum%2!=1){
		o.back()+=1;
		sum+=1;
	}
	int nd=(sum-1)/2;
	Rep(i,(int)o.size()-1,0){
		if(nd>=o[i])nd-=o[i],o[i]=-o[i];
	}
	if(nd!=0)puts("QAQ");
	return o;
}

signed main()
{
	n=read(),k=read();
	vi tmp=cons(k);
//	for(int x:tmp)cout<<x<<" ";cout<<"\n";
	For(i,0,n-2){
		int u=i;
		for(int x:tmp){
			u=u+x;
			u=(u%n+n)%n;
			res.pb(u);
		}
	//	cerr<<res.back()<<"\n";
	}
	for(int x:res)cout<<x+1<<" ";cout<<"\n";
    return 0;
}
/*
2
9
101011110
1 1 3 3 3 6 2 2
4
1011
1 1 3
*/