#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) (int)((x).size())
// #define int ll
//#define N
using namespace std;
bool vis[333335];
unordered_map<int,bool>f[333335];
bool bl[5005][5005];
int ans[1000005];
int n,m;
mt19937_64 rnd(time(0));
inline bool has(int x,int y)
{
    if (n>5000)
    {
        if (f[x].count(y)||f[y].count(x)) return 1;
        return 0;
    }
    return (bl[x][y]||bl[y][x]);
}
inline void add(int x,int y)
{
    if (n>5000) f[x][y]=1;
    else
        bl[x][y]=1;
}
inline void del(int x,int y)
{
    if (n>5000) f[x].erase(y);
    else
        bl[x][y]=0;
}
void dfs(int k,int len)
{
	// assert(len<100000);
	// cout<<k<<" "<<len<<endl;
	if (len%m==0)
	{
		if (vis[k]) return;
		vis[k]=1;
	}
	if (len==1ll*m*(n-1))
	{
		for (int i=1;i<=len;i++) cout<<ans[i]<<" ";cout<<endl;
		// cout<<"ha"<<endl;
		// for (int i=1;i<=n;i++)
		// {
			// for (int j=1;j<=n;j++)
				// cout<<f[i][j];
			// cout<<'\n';
		// }
		// for (int i=1;i<=n;i++) cout<<vis[i]<<" ";
		// cout<<'\n';
		exit(0);
	}
	poly g;
	int t=0;
	while (t<=1000ll)
	{
		++t;
		int u=rnd()%n+1;
		if (u==k||has(k,u)||u==k) continue;
		// f[k][u]=1;
        add(k,u);
		ans[len+1]=u;
		dfs(u,len+1);
        del(k,u);
	}
	if (len%m==0)
	{
		vis[k]=0;
	}
}
void BellaKira()
{
	cin>>n>>m;
	if (m==1)
	{
		for (int i=2;i<=n;i++) cout<<i<<" ";
		cout<<'\n';
		return;
	}
	if (m==2)
	{
		for (int i=2;i<=n;i++)
		{
			cout<<i%n+1<<" ";
			cout<<i<<" ";
		}
		cout<<'\n';
		return;
	}
	if (m==3)
	{
		int x=0;
		for (int i=2;i<=n;i++)
		{
			cout<<(x+4)%n+1<<" ";
			cout<<(x+2)%n+1<<" ";
			cout<<(x+1)%n+1<<" ";
			x=(x+1)%n;
		}
		return;
	}
	if (m==4)
	{
		int x=0;
		for (int i=2;i<=n;i++)
		{
			cout<<(x+8)%n+1<<" ";
			cout<<(x+4)%n+1<<" ";
			cout<<(x+2)%n+1<<" ";
			cout<<(x+1)%n+1<<" ";
			x=(x+1)%n;
		}
		return;
	}
	if (m==5)
	{
		int x=0;
		for (int i=2;i<=n;i++)
		{
			cout<<(x+16)%n+1<<" ";
			cout<<(x+8)%n+1<<" ";
			cout<<(x+4)%n+1<<" ";
			cout<<(x+2)%n+1<<" ";
			cout<<(x+1)%n+1<<" ";
			x=(x+1)%n;
		}
		return;
	}
	if (m==6)
	{
		int x=0;
		for (int i=2;i<=n;i++)
		{
			cout<<(x+32)%n+1<<" ";
			cout<<(x+16)%n+1<<" ";
			cout<<(x+8)%n+1<<" ";
			cout<<(x+4)%n+1<<" ";
			cout<<(x+2)%n+1<<" ";
			cout<<(x+1)%n+1<<" ";
			x=(x+1)%n;
		}
		return;
	}
	dfs(1,0);
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}