import java.util.Scanner;
public class LinkNode {              //單向鏈表的節點類
    public int data;                 //存放節點值
    public LinkNode next;            //存放節點值的引用
   
    public LinkNode(int k){         //構造方法 ，值為k的節點
        data = k;
        next= null;
    }
}
 class Josephus{
    public static void printJosephus(int n,int s,int d){       
        int i=1;                    //創建長為n的循環列表
        LinkNode q,tail;
        
        LinkNode head = new LinkNode(i);
        head.next = head ;
        tail = head;             //第一個節點，尾巴和頭在一起
       
        while(i<n){
            i++;
            q = new LinkNode(i);    //增加一個新節點
            q.next = head ;        //節點的引用指向頭
            tail.next = q;            //最后一個元素的引用指向了q
            tail = q;              //那么最后一個元素就是q
        }

        int j= 0;               //從s開始報數，依次輸出出列人的編號
        LinkNode p = head;      //計數起點
        while(j<s-1){
            j++;
            p = p.next;
        }
        while(p.next != p){
            j = 1;
            while(j<d-1)   //計數的起始點
            {
                j++;
                p = p.next;
            }       
            System.out.print(p.next.data + " ");  // 輸出出列的節點號
            p.next = p.next.next;
            p = p.next;                                //不斷指向下一個節點           
        }
        System.out.print(p.data);
    }

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int a = input.nextInt();
        int b = input.nextInt();
        Josephus.printJosephus(n, a, b);
    }
}