def calc(k, vs, sumVs):
    ng = -1
    ok = k
    while ok - ng >= 2:
        mid = (ok + ng) // 2
        if vs[2][mid] - vs[1][3 * k - 2 * mid - 1] - vs[1][3 * k - 2 * mid - 2] <= 0:
            ok = mid
        else:
            ng = mid
    return sumVs[2][ok] + sumVs[1][3 * k - 2 * ok]    

N, K, seed, a, b, m = map(int, input().split())
f = []
f.append(seed)
for i in range(1, 2 * N):
    f.append((f[i - 1] * a + b) % m)

vs = [[] for _ in range(4)]    # vs[i]: 重さiの荷物の価値配列
sumVs = [[] for _ in range(4)] # sumVs[i][j]: vs[i][0] + ... + vs[i][j - 1]
for i in range(N):
    w = f[i] % 3 + 1
    v = w * f[N + i]
    vs[w].append(v)

for i in range(1, 4):
    vs[i].sort(reverse = True)
    cnt = 3 * K if i == 1 else K
    while len(vs[i]) < cnt:
        vs[i].append(0)
    sumVs[i].append(0)
    for v in vs[i]:
        sumVs[i].append(sumVs[i][-1] + v)

ans = 0
for i in range(K + 1): # 重さ3の荷物をi個選ぶ
    ans = max(ans, sumVs[3][i] + calc(K - i, vs, sumVs))
print(ans)