#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <queue>
#include <cassert>

using namespace std;

#define int long long
#define PII pair<int,int>
#define x first
#define y second
#define For(i, l, r) for(int i = l; i <= r; i ++)
#define Rep(i, l, r) for(int i = l; i >= r; i --)

bool START;

void in(int &x)
{
	char c = getchar(); int op = 1;
	while(c > '9' || c < '0') op *= (c == '-' ? -1 : 1), c = getchar();
	for(x = 0; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0'; x *= op;
}

const int N = 2e5 + 50, P = 1e9 + 7, oo = 1e15, Big = 1e11;

int n, m, S, T, q = 101, b = 137, a[N], x[N], y[N], z[N], tot, sz[N];
int U[N], V[N], W[N], fa[N], me[N];
int find(int x)
{
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}

namespace sub0
{
	void solve()
	{
		int ans = 0;
		For(s, 1, (1 << n) - 1)
		{
			int res = 0;
			For(i, 1, tot)
			{
				if(s >> (U[i] - 1) & 1) if(s >> (V[i] - 1) & 1)
					res -= W[i];
			}
			For(i, 1, n) if(s >> ( i - 1) & 1) res += a[i];
			ans = max(ans, res);
		}
		printf("%lld\n", ans);
	}
}

int f[N], g[N], p[N], cnt;
vector<PII> G[N];
vector<int> vec[N];

void dfs_t(int u, int pa)
{
	f[u] = a[u]; g[u] = 0;
	for(PII E : G[u])
	{
		int v = E.x, w = E.y;
		if(v == pa) continue;
		dfs_t(v, u);
		g[u] += max(g[v], f[v]);
		f[u] += max(f[v] - w, g[v]);
	}
}

bool vis[N];
int mxd, dep[N], pos[N], num;
vector<PII> tr[N];

void dfs1(int u, int pa)
{
	vis[u] = 1; dep[u] = dep[pa] + 1;
	for(PII E : G[u])
	{
		int v = E.x, w = E.y;
		if(v == pa) continue;
		if(!vis[v])
		{
			dfs1(v, u), tr[u].push_back({v, w});
		}
		else
		{
			pos[++ num] = u, pos[++ num] = v;
		}
	}
}

void dfs2(int u, int pa)
{
	for(PII E : tr[u])
	{
		int v = E.x, w = E.y;
		dfs2(v, u);
		g[u] += max(g[v], f[v]);
		f[u] += max(f[v] - w, g[v]);
	}
}


map<PII, int> mp;
bool ENDPOS = 0;
signed main()
{
	in(n); in(m); in(x[0]); in(y[0]); in(a[0]); in(z[0]);
	For(i, 1, n) a[i] = (q * a[i - 1] + b) % P;
	tot = 0;
	For(i, 1, m)
	{
		x[i] = (x[i - 1] * q + b) % P;
		y[i] = (y[i - 1] * q + b) % P;
		z[i] = (z[i - 1] * q + b) % P;
		int u = x[i] % n + 1, v = y[i] % n + 1;
		if(u == v || mp.count({u, v}));
		else {
			tot ++;
			U[tot] = u; V[tot] = v; W[tot] = z[i];
			G[u].push_back({v, z[i]}); G[v].push_back({u, z[i]});
			mp[{u, v}] = mp[{v, u}] = z[i];
		}
	}
	// sub0::solve();
	For(i, 1, n) fa[i] = i;
	For(i, 1, tot)
	{
		fa[find(U[i])] = find(V[i]);
	}
	For(i, 1, n) sz[find(i)] ++; For(i, 1, m) me[find(U[i])] ++;
	int mx = 0, ans = 0;
	For(i, 1, n) vec[find(i)].push_back(i);
	For(i, 1, n) if(find(i) == i)
	{
		if(me[i] == sz[i] - 1)
		{
			dfs_t(i, 0); ans += max(f[i], g[i]); continue;
		}
		num = 0;
		dfs1(i, 0);
		sort(pos + 1, pos + num + 1); num = unique(pos + 1, pos + num + 1) - pos - 1;
		int res = 0;
		For(s, 0, (1 << num) - 1)
		{
			For(j, 1, n) f[j] = a[j], g[j] = 0;
			For(j, 1, num) if(s >> (j - 1) & 1) g[pos[j]] = -oo; else f[pos[j]] = -oo;
			int E = 0;
			For(i, 1, num) For(j, 1, i - 1) if(s >> (i - 1) & 1) if(s >> (j - 1) & 1)
			{
				if(mp.count({pos[i], pos[j]})) E += mp[{pos[i], pos[j]}];
			}
			dfs2(i, 0); res = max(res, max(f[i], g[i]) - E);
		}
		ans += res;
	}
	printf("%lld\n", ans);
	cerr << (&ENDPOS - &START) * 1.0 / 1024 / 1024 << endl;
	return 0;
}