def countSort(arr, pas):
    length_ar = len(arr)
    v = [0] * length_ar
    b = [0] * length_ar

    for i in range(length_ar):
        v[(arr[i] // pas) % 10] = v[(arr[i] // pas) % 10] + 1

    for i in range(length_ar):
        v[i] = v[i] + v[i - 1]

    for i in range(length_ar - 1, -1, -1):
        v[(arr[i]) // pas % 10] = v[(arr[i]) // pas % 10] - 1
        b[v[(arr[i]) // pas % 10]] = arr[i]

    for i in range(length_ar):
        arr[i] = b[i]


def radix_sort(arr):
    max1 = max(arr)
    pas = 1

    while max1 // pas > 0:
        countSort(arr, pas)
        pas = pas * 10


n = int(input())
a = int(input())
b = int(input())
c = int(input())
v = [0]
v[0] = b
i = 1
while i < n:
    v.append((a * v[i - 1] + b) % c)
    i = i+1
radix_sort(v)

i = 0

while i < n:
    print(v[i])
    i = i + 10