#include <bits/stdc++.h>

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

unsigned long long int n, a, b, c, level;

int main()
{
    f >> n >> a >> b >> c;
    int v[n + 5], w[n + 5];
    v[1] = b;
    for(int i = 2; i <= n; i++)
        v[i] = 1LL * (1LL  * v[i-1] * a + b) % c;

    int freq[260], poz[260];
    for(int i = 0, mask = 255; i < 32; i += 8, mask <<= 8)
    {
        for(int k = 0; k<=256; k++)
        {
            freq[k] = 0;
            poz[k] = 0;
        }
        for (int j = 1; j <= n; j ++)
        {
            int c = (v[j] & mask) >> i;
            freq[c] ++;
        }
        for(int j = 1; j < 256; j ++) freq[j] += freq[j-1];

        for(int j = 1; j <= n; j ++)
        {
            int c =(v[j] & mask) >> i;
            int newpoz = ++poz[c];
            if(c) newpoz += freq[c - 1];
            w[newpoz] = v[j];
        }
        for(int j = 1; j <= n; j ++)
        {
            v[j] = w[j];
        }

    }

    for(int i = 1; i <= n; i += 10)
        g << v[i] << " ";
    return 0;
}