#include<bits/stdc++.h>
#define ll long long 
using namespace std;
ll n , a[1000010] , b[1000010] , maxn = INT_MIN , maxi = INT_MIN ;
int main() {
	cin >> n >> a[1] ;
	b [ a[1] ]++ ;
	for ( int i = 2 ; i <= n ; i++ ) {
		a[i] = ( ( a[i-1]) * 3703 + 1047 ) % n + 1 ;
		b[ a[i] ]++ ;
	}
	int ls=1;
	a[b[1]]++;
	for ( int i = 2 ; i <= n ; i++ ) {
		if(b[i]==b[i+1]){
			ls++;
			if(ls>=3) a[b[i]]+=3;
			else a[b[i]]+=ls;
		}else {
			ls=1;
			a[b[i]]+=ls;
		}
	}
	for(int i=1;i<=n;i++){
		if(maxn<a[i]) {
			maxn=a[i];
			maxi=i;
		}
	}
	cout << maxi ;
    return 0;
}