#include<stdio.h>

 #define    maxn    20

 int a[maxn+], n; 

 int go( int p,int d,int t )

 {//    printf("a[%d]=%d\n",p,a[p]);

     while( t-- )

     {　　//该题的核心所在

         do{

             p = (p+d+n-) % n +;

         }while( a[p] ==  );

     }

     return p;

 }

 int main()

 {

     int k, m, p1, p2;

     while( scanf("%d%d%d",&n, &k, &m) ==  )

     {

         for( int i=; i<=n; i++ )    a[i] = i;//位置初始化

         printf("\n");

         p1 = , p2 = n;

         int left=n;

         while(left)

         {//printf("a[p1]=%d,a[p2]=%d\t",a[p1],a[p2]);

             p1 = go( p1, ,k );

             p2 = go( p2, -,m );

             a[p1] = a[p2] = ;

             //printf("p1=%d p2=%d\n\n",p1,p2); 

             printf("%3d",p1); left--;

             if( p1 != p2 )    { printf("%3d",p2); left--; }

             if(left)        printf(",");

         }

         printf("\n");

     }

     return ;

 }