#include<bits/stdc++.h>
#define pi pair<int,int>
using namespace std;
const int N=5005;
int n,m,cnt;
struct Node{
	int next,to;
}a[N];
int head[N],tot,ceng;
unordered_map<int,int> vis;
map<pi,int> vis1;
void add(int u,int v){
	a[++tot].next=head[u];
	a[tot].to=v;
	head[u]=tot;
}
void dfs(int u,int fa){
	for(int i=head[u];i;i=a[i].next){
		int v=a[i].to;
		if(v==fa)continue ;
		if(vis[v%n+1]==1)continue ;
		//cout<<"from "<<u<<" to "<<v<<" cnt "<<cnt<<endl;
		cnt++;
		if(cnt%m==0){
			vis[v%n+1]=1;
			cout<<v%n+1<<" ";
		}
		dfs(v,u);
	}
}
int main(){
	cin>>n>>m;
	ceng=n*m;
	for(int i=1;i<=n;i++){
		for(int k=1;k<=ceng;k++){
			add(i*k,i*k+1);
			//cout<<"from "<<i*k<<" to "<<i*k+1<<endl;
		}	
	}	
	cnt=1;
	dfs(1,0);
	return 0;
}