#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> a;
long long s=0;
long long n,k,q,x,y,z;
int main()
{
	freopen("beri.in","rt",stdin);
	freopen("beri.out","wt",stdout);
	scanf("%d%d",&n,&k);
	scanf("%d%d%d%d",&q,&x,&y,&z);
	a.push_back(q);
	for(int i=1;i<n;i++)
	{
		//C[i] = ( C[i-1] * X + Y ) % Z + K 
		a.push_back( (a[i-1]*x +y)%z +k );
	}
	int d=0;
	sort(a.begin(),a.end());
	for(int i=n-k;i<n;i++)
	{
		s+=a[i]-d;
		k--; d++;
	}
	printf("%lld\n",s);
	return 0;
}