#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void Main()
{
	int N,K;
	long long s,a,b,m;
	cin >> N >> K >> s >> a >> b >> m;
	vector<long long> f(2 * N);
	f[0] = s;
	for(int i = 0;i + 1 < 2 * N;i++)
	{
		f[i + 1] = (a * f[i] + b) % m;
	}
	vector<vector<long long>> G(4);
	for(int i = 0;i < N;i++)
	{
		int w = f[i] % 3 + 1;
		long long v = w * f[N + i];
		G[w].push_back(v);
	}
	for(int i = 1;i <= 3;i++)
	{
		if(i == 1)
		{
			while(G[i].size() < 3 * K)
			{
				G[i].push_back(0ll);
			}
		}
		else
		{
			while(G[i].size() < K)
			{
				G[i].push_back(0ll);
			}
		}
		sort(G[i].rbegin(),G[i].rend());
	}
	long long ans = 0;
	long long S3 = 0;
	vector<vector<long long>> S(3);
	for(int i = 1;i <= 2;i++)
	{
		S[i].resize(G[i].size() + 1);
		for(int j = 0;j < (int)G[i].size();j++)
		{
			S[i][j + 1] = S[i][j] + G[i][j];
		}
	}
	for(int i = 0;i <= K;i++)
	{
		long long cur = S3;
		int ng = -1,ok = K - i;
		while(ok - ng > 1)
		{
			int mid = (ok + ng) / 2;
			long long df = G[2][mid] - (G[1][3 * (K - i) - 2 * mid - 2] + G[1][3 * (K - i) - 2 * mid - 1]);
			if(df <= 0)
			{
				ok = mid;
			}
			else
			{
				ng = mid;
			}
		}
		cur += S[2][ok] + S[1][3 * (K - i) - 2 * ok];
		ans = max(ans,cur);
		if(i < K)
		{
			S3 += G[3][i];
		}
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}