# include <bits/stdc++.h> using namespace std ; queue <int> q ; int main ( ) { int n , m ; cin >> m >> n ; for ( int i = 1 ; i <= n ; i ++ ) { q . push ( i ) ; } if ( n == 1 ) { cout << q . front ( ) << endl ; return 0 ; } while ( ! q . empty ( ) ) { if ( q . size ( ) == 1 ) { cout << q . front ( ) << endl ; return 0 ; } for ( int j = 1 ; j < m ; j ++ ) { int x = q . front ( ) ; q . pop ( ) ; q . push ( x ) ; } q . pop ( ) ; } return 0 ; }