#include<bits/stdc++.h>
using namespace std;
int n,p[1000010],minn=1000,k,maxn=-1;
int main(){
	cin>>n>>k>>p[0];
	for(int i=1;i<=k;i++){
		minn=1000;
		for(int j=i;j<=k;j++){
			p[j]=p[j-1]+1+(p[j-1]*2357+137)%10;
			minn=min(minn,p[j]-p[j-1]);
		}
		maxn=max(maxn,minn);
	}
	cout<<maxn;
}

995