#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("beri.in");
ofstream g("beri.out");

int K,N;
long long C[1000099],Q,X,Y,Z;

int main()
{
    f>>N>>K>>Q>>X>>Y>>Z;
    C[1]=Q;
    for(int i=2;i<=N;++i)
    {
        long long aux=C[i-1]*X+Y;
        while(aux>Z)aux-=Z;
        C[i]=aux+K;
    }
    sort(C+1,C+1+N);
    long long S=0;
    for(int i=N-K+1;i<=N;++i)S+=C[i];
    S-=(1LL*K*(K-1)/2);
    g<<S<<'\n';
    return 0;
}