#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N,K,seed,A,B,M;
    cin>>N>>K>>seed>>A>>B>>M;
    vector<ll> F(N*2);
    F[0]=seed;
    rep(i,1,N*2) F[i]=(F[i-1]*A+B)%M;
    vector<ll> W(N),U(N);
    rep(i,0,N) W[i]=F[i]%3+1,U[i]=W[i]*F[i+N];
    vector<vector<ll>> G(4);
    rep(i,0,N) G[W[i]].push_back(U[i]);
    rep(i,1,4) Sore(G[i]);
    vector<vector<ll>> sum(4);
    rep(i,1,4){
        sum[i].resize(1+int(G[i].size()),0);
        rep(j,0,G[i].size()) sum[i][j+1]=sum[i][j]+G[i][j];
    }
    auto f=[&](int wei,int ind,int num) -> ll {
        int X=ind,Y=ind+num;
        if(X>=int(sum[wei].size())) return 0;
        if(Y>=int(sum[wei].size())) Y=int(G[wei].size());
        return sum[wei][Y]-sum[wei][X];
    };
    ll ans=0,tmp=0;
    rep(i,0,1+int(G[2].size())){
        if(K<i) break;
        int L=-1,R=K-i;
        while(R-L>1){
            int med=(R+L)/2;
            int st1=i+3*(K-i-1-med);
            int st3=med;
            if(f(1,st1,3)<f(3,st3,1)) L=med;
            else R=med;
        }
        chmax(ans,tmp+f(3,0,R)+f(1,i,(K-i-R)*3));
        tmp+=f(1,i,1);
        tmp+=f(2,i,1);
    }
    chmax(ans,tmp);
    cout<<ans<<"\n";
}