import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n,k,seed,a,b,m=LI()
ff=[seed]
for _ in range(2*n):
    ff.append((ff[-1]*a%m+b)%m)
ww=[f%3+1 for f in ff]
vv=[ww[i]*ff[n+i] for i in range(n)]

v1=[]
v2=[]
v3=[]
for w,v in zip(ww,vv):
    if w==1:v1.append(v)
    if w==2:v2.append(v)
    if w==3:v3.append(v)

def tocs(vv):
    vv.sort(reverse=True)
    cs=[0]
    for v in vv:cs.append(cs[-1]+v)
    return cs

s1=tocs(v1)
s2=tocs(v2)
s3=tocs(v3)
# pDB(v1)
# pDB(s1)

def binary_search(l, r, minimize,c):
    if minimize: l -= 1
    else: r += 1
    while l+1 < r:
        m = (l+r)//2
        if ok(m,c) ^ minimize: l = m
        else: r = m
    if minimize: return r
    return l

def ok(b,c):
    return bc2val(b,c)>=bc2val(b+1,c)

def bc2val(b,c):
    a=min(len(v1),(k-c-b)*3+b)
    return s3[c]+s2[b]+s1[a]

ans=0
for c in range(min(len(v3),k)+1):
    b=binary_search(0,min(k-c,len(s2)),True,c)
    ans=max(ans,bc2val(b,c))

print(ans)