#include <bits/stdc++.h>
using namespace std;
const int B = 1<<11;
int v[2][10000005];
int nr[10000005], poz[10000005], aux[10000005];
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int main()
{
    int n, a, b, c, p, k, j, i;
    in>>n>>a>>b>>c;
    v[1][1] = b;
    for(i = 2; i <= 10000000; i++)
        v[1][i] = (a * v[1][i - 1] + b) % c;
    for(k = 1; k <= 3; k++)
    {
        for(j = 0; j < B; j++)
            nr[j] = 0;
        for(i = 1; i <= n; i++)
           nr[(v[k & 1][i] >> ((k - 1) * 11)) & (B - 1)]++;
        poz[0] = 0;
        for(i = 1; i < B; i++)
            poz[i] = poz[i - 1] + nr[i - 1];
        for(i = 1; i <= n; i++)
            v[(k - 1) & 1][++poz[(v[k & 1][i] >> ((k - 1) * 11)) & (B - 1)]] = v[k & 1][i];
    }
    for(int i = 1; i <= n; i += 10)
    {
        out << v[2 & 1][i] << " ";
    }
    return 0;
}