#include <fstream>

using namespace std;

ifstream cin("radixsort.in");
ofstream cout("radixsort.out");

#define MAXN 10000000
const int NB = 11;
const int B = (1 << NB);

int v[2][MAXN];
//int aux[MAXN];
int nr[B];
int poz[B];

int main() {

    int n, a, b, c;
    cin >> n >> a >> b >> c;

    int nc = 0, maxx = 0;

    v[0][0] = b;

    for(int i = 1; i < n; i++)
    {
        v[0][i] = (1LL * a * v[0][i-1] + 1LL * b) % c;
        maxx = max(maxx, v[0][i]);
    }

    while(maxx)
    {
        nc++;
        maxx /= B;
    }


    int p = 0;

    for(int k = 0; k < nc; k++)
    {
        p = k * NB;
        for(int j = 0; j < B; j++)
            nr[j] = 0;

        for(int i = 0; i < n; i++)
        {
            int cif = (v[k%2][i] >> p) & (B - 1);
            nr[cif]++;
        }

        poz[0] = 0;
        for(int j = 1; j < B; j++)
            poz[j] = poz[j-1] + nr[j-1];

        for(int i = 0; i < n; i++)
        {
            int cif = (v[k%2][i] >> p)&(B - 1);
            v[1-k%2][poz[cif]++] = v[k%2][i];
        }
    }

    for(int i = 0; i < n; i += 10)
        cout << v[nc%2][i] << " ";

    return 0;

}