#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int mod=1e9+7;
const int N=1e7+10;
typedef long long ll;
int seed,n,k,ver[N],to[N],nxt[N],idx,t,son[N];
ll val[N],dep[N],ans[N],res;
void add(int x,int y){
	to[++idx]=y,nxt[idx]=ver[x],ver[x]=idx;
}
void dfs1(int x,int fa){
	for(int i=ver[x];i;i=nxt[i]){
		if(to[i]==fa)continue;dfs1(to[i],x);
		if(dep[to[i]]>dep[son[x]])son[x]=to[i];
	}
	dep[x]=dep[son[x]]+val[x];
	return;
}
void dfs2(int x,int fa,int tp){
	if(x==tp)ans[++t]=dep[x];	
	if(!son[x])return;
	dfs2(son[x],x,tp);
	for(int i=ver[x];i;i=nxt[i]){
		if(to[i]==fa)continue;
		if(to[i]==son[x])continue;
		dfs2(to[i],x,to[i]);
	}
	return;
}
bool cmp(ll a,ll b){
	return a>b;
}
int main(){
	freopen("x.in","r",stdin);
	freopen("x.in","w",stdout);
	scanf("%d %d %d",&n,&k,&seed);val[1]=seed;
	for(int i=2,fa;i<=n;i++){
		val[i]=(val[i-1]*23333333+6666666)%mod;
		fa=(val[i]^23333333)%(i-1)+1;add(fa,i);
	}
	dfs1(1,0);
	dfs2(1,0,1);
	sort(ans+1,ans+1+t,cmp);
	for(int i=1;i<=min(k,t);i++)res+=ans[i];
	printf("%lld\n",res);
	return 0;
}