#include using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector vi; typedef vector vll; typedef vector vc; typedef vector vst; typedef vector vd; typedef vector vld; typedef pair P; template long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template auto min(const T& a){ return *min_element(a.begin(), a.end()); } template auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template istream &operator>>(istream &is, pair &p){ is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template istream &operator>>(istream &is, vector &v){ for(T &in : v) is >> in; return is; } template ostream &operator<<(ostream &os, const vector &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template ostream &operator<<(ostream &os, const map &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template ostream &operator<<(ostream &os, const set &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, const multiset &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template ostream &operator<<(ostream &os, queue q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template ostream &operator<<(ostream &os, deque q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template ostream &operator<<(ostream &os, stack st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template ostream &operator<<(ostream &os, priority_queue pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template void inGraph(vector>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } ll n, k, seed, a, b, m; void input(){ in(n, k, seed, a, b, m); } void solve(){ vll f(2 * n); f[0] = seed; rep(i, 1, 2 * n){ f[i] = (a * f[i - 1] + b) % m; } vll v(n), w(n); rep(i, n){ w[i] = (f[i] % 3) + 1; v[i] = w[i] * f[n + i]; } out(w); vector> q(4); rep(i, n){ q[w[i]].push(v[i]); } using T = tuple; priority_queue, greater> fin; while(q[1].size() && q[2].size()){ ll t1 = q[1].top(), t2 = q[2].top(); fin.emplace(t1 + t2, 2, t2); q[1].pop(); q[2].pop(); } while(q[3].size()){ ll t = q[3].top(); q[3].pop(); fin.emplace(t, 3, t); } while(q[2].size()){ ll t = q[2].top(); q[2].pop(); fin.emplace(t, 3, t); } while(fin.size() > k){ fin.pop(); } ll ans = 0; while(fin.size()){ auto [vt, typ, vt2] = fin.top(); fin.pop(); if(typ == 2){ if(q[1].size() >= 2){ ll t1 = q[1].top(); q[1].pop(); ll t2 = q[1].top(); q[1].pop(); out(t1 + t2, vt2); if(vt2 < t1 + t2){ vt += t1 + t2 - vt2; }else{ q[1].push(t1); q[1].push(t2); } }else if(q[1].size() == 1){ ll t1 = q[1].top(); q[1].pop(); if(vt2 < t1){ vt += t1 - vt2; }else{ q[1].push(t1); } } }else if(typ == 3){ if(q[1].size() >= 3){ ll t1 = q[1].top(); q[1].pop(); ll t2 = q[1].top(); q[1].pop(); ll t3 = q[1].top(); q[1].pop(); if(vt2 < t1 + t2 + t3){ vt += t1 + t2 + t3 - vt2; }else{ q[1].push(t1); q[1].push(t2); q[1].push(t3); } }else if(q[1].size() == 2){ ll t1 = q[1].top(); q[1].pop(); ll t2 = q[1].top(); q[1].pop(); if(vt2 < t1 + t2){ vt += t1 + t2 - vt2; }else{ q[1].push(t1); q[1].push(t2); } }else if(q[1].size() == 1){ ll t1 = q[1].top(); q[1].pop(); if(vt2 < t1){ vt += t1 - vt2; }else{ q[1].push(t1); } } } ans += vt; } out(ans); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }