#include <bits/stdc++.h>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int n, numbers[10000001], byte;

void citire(int & n, int numbers[])
{
    int a, b, c;
    fin >> n >> a >> b >> c;
    numbers[0] = b % c;
    for(int i = 1; i < n; i++)
        numbers[i] = (1LL * a * numbers[i-1] % c + b) % c;
}

int get_byte(int x, int byte)
{
    return (x>>(byte * 8)) & 0xFF;
}

void countsort(int A[], int B[], int byte)
{
    int counter[1<<8];
    int index[1<<8];

    for(int i = 0; i < 1<<8; i++)
        counter[i] = 0;

    for(int i = 0; i < n; i ++)
        counter[get_byte(A[i], byte)]++;

    index[0] = 0;

    for(int i = 1; i < 1<<8; i ++)
        index[i] = index[i-1] + counter[i-1];

    for(int i = 0; i < n; i ++)
        B[index[get_byte(A[i], byte)]++] = A[i];
}

void radixsort() {
    int *temp = new int[n];
    for (int i = 0; i < sizeof(numbers[0]); i ++)
        if(i % 2 == 0)
            countsort(numbers, temp, i);
        else
            countsort(temp, numbers, i);
}

int main()
{
    citire(n, numbers);
    radixsort();
    for(int i = 0; i < n; i += 10)
        fout << numbers[i]<< ' ';
    fout << '\n';
    return 0;
}