#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const int maxn=25;
int n,m,k,a[maxn];
int go(int p,int d,int t){
while(t--){
do{
p=(p+d+n-1)%n+1;//先保证他在0-n-1范围内,然后加一,保证他在1到n之间
}while(a[p]==0);
}
return p;
}
int main(){
while(scanf("%d%d%d",&n,&m,&k)){
for(int i=1;i<=n;i++)a[i]=i;
int left=n;
int p1=n,p2=1;
while(left){
p1=go(p1,1,k);
p2=go(p2,-1,m);
printf("%3d",p1);
left--;
if(p2!=p1){
printf("%3d",p2);
left--;
}
a[p1]=a[p2]=0;
if(left)printf(",");
}
printf("\n");
}
return 0;
}