#include <iostream>
#include <fstream>
#define N 10000001
int v[N];
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int Max(int n)
{
    int Max = v[0];
    for (int i = 1; i < n; i++)
        if (v[i] > Max)
            Max = v[i];
    return Max;
}
void countSort(int n, int poz) {
    int a[n];
    int i, b[10] = { 0 };
    for (i = 0; i < n; i++)
        b[(v[i] / poz) % 10]++;
    for (i = 1; i < 10; i++)
        b[i] += b[i-1];
    for (i = n - 1; i >= 0; i--)
    {
        a[b[(v[i] / poz) % 10] - 1] = v[i];
        b[(v[i] / poz) % 10]--;
    }
    for (i = 0; i < n; i++)
        v[i] = a[i];
}
void radixsort(int n)
{
    int m = Max(n);
    for (int poz = 1; m / poz > 0; poz *= 10)
        countSort(n, poz);

}


int main()
{
    int n,A,B,C;
    fin >> n>>A>>B>>C;
    v[0]=B;
    for (int i = 1; i < n; i++)
        v[i]=(A * v[i-1] + B) % C;
    radixsort(n);
    for (int i = 0; i < n; i+=10)
        fout << v[i] << " ";
    return 0;
}