#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 4000005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,k,a[N],f[N],t[N],h[N],cnt,ans,x,y,z;
struct edge{int v,n;}e[N];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void dfs(int u)
{
	int p=0;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		dfs(v);
		if(!p||f[v]>f[p])
			p=v;
	}
	f[u]=a[u]+f[p];
	f[p]=0;
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("x.in","r",stdin);freopen("x.out","w",stdout);
	n=read();k=read();a[1]=read();
	fo(i,2,n)a[i]=(a[i-1]*23333333+6666666)%1000000007;
	fo(i,2,n)ad((a[i]^23333333)%(i-1)+1,i);
	dfs(1);
	k=min(k,n);
	sort(f+1,f+n+1);
	rf(i,n,n-k+1)ans+=f[i];
	printf("%lld",ans);
	return 0;
}