N, a1, k, b, m = map(int, input().split())
A = []
for i in range(1,N+1):
A.append(a1)
a1 = (k*a1 + b) % m
N = len(A)
d = [None] * N
pred = [None] * N
for i in range(N):
d[i] = 1
pred[i] = -1
for j in range(i):
if int(A[j]) < int(A[i]):
if d[i] < 1+d[j]:
d[i] = d[j]+1
pred[i] = j
otv = d[0]
path = []
for i in range(N):
if otv < d[i]:
otv = d[i]
poz = i
while poz != -1:
path.append(poz)
poz = pred[poz]
for i in path[::-1]:
print(A[i], end = ' ')