public class 模擬 {
  public static void main(String[] args) {
    Scanner in=new Scanner(System.in);

    //總?cè)藬?shù)
    int n=in.nextInt();
    // 數(shù)到m的那個(gè)人出列
    int m=in.nextInt();
    // 初始化為0 都沒有出去
    int [] arr=new int[n];

    //剩下的人數(shù)
    int peopleLeft=n;
    //初始化下標(biāo)
    int index=0;
    // 下標(biāo)計(jì)算器
    int count=0;
    // >0 出循環(huán)為負(fù)
    while (peopleLeft>1){
      if(arr[index]==0){
        // count為計(jì)步器 不是下標(biāo)指向
        count++;
        if(count==m){
          arr[index]=1;
          count=0;
          peopleLeft--;
        }
      }
      index++;
      if(index==arr.length){
        index=0;
      }
    }
    for (int i = 0; i < arr.length; i++) {
      if(arr[i]==0){
        System.out.println(i+1);
      }
    }
  }
}

/**
   * 遞歸式:
   * f(1)=0; 第一個(gè)位置永遠(yuǎn)為0
   * f(i)=f(i)+m%n;
   */
  public static int yuesefu(int n,int m){
    if(n==1){
      return 0;
    }else {
      return (yuesefu(n-1,m) + m) % n;
    }
  }
  public static void main(String[] args) {
    System.out.println(yuesefu(41,3)+1);
    vailCode(41,3);
  }

  //逆推驗(yàn)證代碼
  public static void vailCode(int a,int b){
    System.out.print(b);
    int reslut;
    for (int i = a; i >=2 ; i--) {
       reslut=2;
      for (int j = i; j <=a ; j++) {
        reslut=(reslut+b)%j;
      }
      System.out.printf("->%d",reslut+1);
    }
  }

public class CircularLinkedList {
  public static void main(String[] args) {
    /**
     * 節(jié)點(diǎn)類
     */
    class Node{
      private int data=1;
      private Node next;
      Node(){
        next=null;
      }
    }

    Node head,temp;
    head=new Node();
    head.data=1;

    int a=41;
    int b=3;
    // 臨時(shí)節(jié)點(diǎn)
    temp=head;
    for (int i = 0; i < a; i++) {
      Node new_node=new Node();
      new_node.data=i+1;
      temp.next=new_node;
      temp=new_node;
    }
    temp.next=head.next;
    while (head.next!=head){
      for (int i = 0; i < b-1; i++) {
        head=head.next;
      }
      System.out.print("->"+(head.data+1));
      head.next=head.next.next;
    }
    System.out.println(head.data);
  }
}

public static void main(String[] args) {
    int a=41;
    int b=3;
    LinkedList<Integer> list = new LinkedList<>();
    for (int i = 0; i < a; i++) {
      list.add(i+1);
    }
    while (list.size()>1){
      for (int i = 0; i < b-1; i++) {
        list.add(list.remove());
      }
      System.out.print("->"+list.getFirst());
      list.remove();//remve head
    }
    System.out.println(list.getFirst());
  }