// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll,int>;
#define TEST cerr << "TEST" << endl
#define AMARI 998244353
// #define AMARI 1000000007
#define TIME_LIMIT 1980000
#define el '\n'
#define El '\n'

#define MULTI_TEST_CASE false
void solve(void) {
    //問題を見たらまず「この問題設定から言えること」をいっぱい言ってみる
    //一個解答に繋がりそうな解法が見えても、実装や細かい考察に時間がかかりそうなら別の方針やを考えてみる
    //特に添え字周りはそのままやると面倒＆言い換えが有効なことが多いので書き始める前にじっくり考える
    int n,k;
    ll m,a,b,seed;
    cin >> n >> k >> seed >> a >> b >> m;
    vector<ll> f(2 * n);
    f[0] = seed;
    for(int i = 0; i < 2 * n - 1; i++){
        f[i + 1] = (a * f[i] + b) % m;
    }
    vector<ll> v(n),w(n);
    vector<ll> one,two,three;
    for(int i = 0; i < n; i++){
        w[i] = f[i] % 3 + 1;
        v[i] = w[i] * f[i + n];
        if(w[i] == 1)one.push_back(v[i]);
        if(w[i] == 2)two.push_back(v[i]);
        if(w[i] == 3)three.push_back(v[i]);
    }

    sort(one.begin(),one.end());
    sort(two.begin(),two.end());

    while(!two.empty()){
        ll ot = 0,ooo = 0;

        if(one.size() >= 1)ooo += one[one.size() - 1];
        if(one.size() >= 2)ooo += one[one.size() - 2];
        if(one.size() >= 3)ooo += one[one.size() - 3];
        
        if(one.size() >= 1)ot += one[one.size() - 1];
        if(two.size() >= 1)ot += two[two.size() - 1];
        if(ot >= ooo){
            three.push_back(ot);
            if(!one.empty())one.pop_back(); 
            if(!two.empty())two.pop_back();
        }
        else{
            three.push_back(ooo);
            for(int i = 0; i < 3 && !one.empty(); i++)one.pop_back();
        }
    }
    while(!one.empty()){
        ll temp = 0;
        for(int i = 0; i < 3 && !one.empty(); i++){
            temp += one.back();
            one.pop_back();
        }
        three.push_back(temp);
    }
    sort(three.rbegin(),three.rend());
    ll ans = 0;
    for(int i = 0; i < three.size(); i++){
        if(i >= k)break;
        ans += three[i];
    }
    cout << ans << El;
    return;
}

void calc(void) {
    return;
}

signed main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE) cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}