#include <bits/stdc++.h>
#define int long long
using namespace std ;
int n , k , a [1000010] , t , w , mid , bao ;
bool pd (int x)
{
	int sum = 1 , l ;
	l = a [1] ;
	for (int i = 2 ; i <= k ; i ++)
		if (a [i] - l >= x)  sum ++ , l = a [i] ;
	return sum >= n ;
}
main ( )
{
	ios::sync_with_stdio (false) ;
	cin.tie (NULL) ; cout.tie (NULL) ;
	cin >> n >> k >> a [1] ;
	for (int i = 2 ; i <= k ; i ++)		
		a [i] = a [i - 1] + ((a [i - 1] * 2357 + 137) % 10) + 1 ;
	sort (a + 1 , a + 1 + n) ;
	t = 1 ; w = 100 ;
	while (t <= w)
	{
		mid = (t + w) / 2 ;
		if (pd (mid))  bao = mid , t = mid + 1 ;
		else  w = mid - 1 ;
	}
	cout << bao ;
	return 0 ;
}