#include <bits/stdc++.h>
#define NMAX 10000000
#define maxBits 32
#define bitsPerStep 8
#define BASE 1 << bitsPerStep

using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");

int ans[NMAX], v[NMAX];
int fr[1 << bitsPerStep], ind[1 << bitsPerStep];
int mask = (1 << bitsPerStep) - 1;

void radixsort(int v[], int a[], int n, int bits)
{
    if(bits == maxBits)
        return ;
    for(int i = 0; i < BASE; i++)
        fr[i] = 0;
    for(int i = 0; i < n; i++)
        fr[v[i] >> bits & mask]++;
    ind[0] = 0;
    for(int i = 1; i < BASE; i++)
        ind[i] = fr[i - 1] + ind[i - 1];
    for(int i = 0; i < n; i++)
        a[ind[v[i] >> bits & mask]++] = v[i];
    radixsort(a, v, n, bits + bitsPerStep);
}

int main()
{
    int n, a, b, c;
    f >> n >> a >> b >> c;
    v[0] = b;
    for(int i = 0; i < n; i++)
        v[i] = (1LL * a * v[i - 1] + b) % c;
    radixsort(v, ans, n, 0);
    for(int i = 0; i < n; i += 10)
        g << v[i] << " ";

    return 0;
}