#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++)
	{
		sort(G[i].begin(),G[i].end());
	}
	long long ans = 0;
	for(int i = 0;i < K;i++)
	{
		long long cur = -1;
		if(G[3].size() >= 1)
		{
			cur = max(cur,G[3].back());
		}
		if(G[2].size() >= 1 && G[1].size() >= 1)
		{
			cur = max(cur,G[2].back() + G[1].back());
		}
		if(G[1].size() >= 3)
		{
			cur = max(cur,G[1][G[1].size() - 1] + G[1][G[1].size() - 2] + G[1][G[1].size() - 3]);
		}
		if(cur != -1)
		{
			ans += cur;
			bool fn = false;
			if(G[3].size() >= 1)
			{
				if(cur == G[3].back())
				{
					G[3].pop_back();
					fn = true;
				}
			}
			if(G[2].size() >= 1 && G[1].size() >= 1)
			{
				if(!fn && cur == G[2].back() + G[1].back())
				{
					G[2].pop_back();
					G[1].pop_back();
					fn = true;
				}
			}
			if(G[1].size() >= 3)
			{
				if(!fn && cur == G[1][G[1].size() - 1] + G[1][G[1].size() - 2] + G[1][G[1].size() - 3])
				{
					for(int j = 0;j < 3;j++)
					{
						G[1].pop_back();
					}
				}
				
			}
		}
		else
		{
			if(G[2].size() >= 1)
			{
				cur = max(cur,G[2].back());
			}
			if(G[1].size() >= 2)
			{
				cur = max(cur,G[1][G[1].size() - 1] + G[1][G[1].size() - 2]);
			}
			if(cur != -1)
			{
				ans += cur;
				bool fn = false;
				if(G[2].size() >= 1)
				{
					if(cur == G[2].back())
					{
						G[2].pop_back();
						fn = true;
					}
				}
				if(G[1].size() >= 2)
				{
					if(!fn && cur == G[1][G[1].size() - 1] + G[1][G[1].size() - 2])
					{
						for(int i = 0;i < 2;i++)
						{
							G[1].pop_back();
						}
					}
				}
			}
			else
			{
				if(G[1].size() >= 1)
				{
					cur = max(cur,G[1].back());
				}
				if(cur != -1)
				{
					ans += cur;
					G[1].pop_back();
				}
			}
		}
	}
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}