#include<iostream>
#include<queue>
#include<algorithm>
#define ll long long
#define rint register int
using namespace std;
const int maxn=1e7+10;
ll cnt,n,m;
int a[maxn],b[maxn];
queue<ll>q;
void generate_array(int n, int m, int seed)
{
    unsigned x = seed;
    for (int i = 0; i < n; ++i) {
        x ^= x << 13;
        x ^= x >> 17;
        x ^= x << 5;
        a[i]=(x % m+ 1);
    }
}
inline ll get(){
    if(q.empty())
        return a[cnt++];
    ll f=q.front();
    if(cnt==n||a[cnt]>f){
        q.pop();
        return f;
    }

    return a[cnt++];
}
int main(){
    ios::sync_with_stdio(false);
    int seed;
    cin>>n>>m>>seed;
    generate_array(n,m,seed);

    sort(a,a+n);

    ll a1,a2;
    for(rint i=1;i<=n-1;i++){
        a1=get();a2=get();
        q.push(max(a1<<1,a2));
    }
    cout<<q.front()<<'\n';
    return 0;
}