def radixsort(v,cif):
    if cif==0:
        return v

    fr = [[] for i in range(10)]

    for elem in v:
        f = (elem//(10**(cif-1))) % 10
        fr[f].append(elem)

    temp = []
    for b in fr:
        if len(b)>1:
            b = radixsort(b,cif-1)
        temp.extend(b)

    return temp


f = open("radixsort.in")
g = open("radixsort.out","w")
v = [int(x) for x in f.readline().split()]
n = v[0]
a = v[1]
b = v[2]
c = v[3]


lista = [b]
for i in range(1,n):
    lista.append((a*lista[i-1]+b)%c)

maxi = 0
mx = max(lista)
while mx:
    maxi+=1
    mx//=10

k = radixsort(lista,maxi)
for i in range(0,n,10):
    g.write(str(k[i]))
    g.write(" ")