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);     } }