m, start, a, b, steps, k = map(int, input().split())

def gen(gm, gs, ga, gb, gst):
    n = gs
    pows = {1: 10, 2: 100, 3: 1000,
           4: 10000, 6: 1000000, 8: 100000000, 12: 1000000000000}
    for i in range(gst):
        n = ga * n + gb
        n = (n // pows[gm]) % pows[2*gm]
        yield n

seq = gen(m, start, a, b, steps)
l = list(seq)
seen = {}
repeat = []
for idx, el in enumerate(l):
    if el not in seen:
        seen[el] = idx
    else:
        repeat.append(idx - seen[el])

print(min(repeat))
print(sorted(l)[k+1])