#include <iostream>
#include <fstream>

using namespace std;

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

typedef long long ll;

const int NB = 16, N = 10000005, NC = 2, B = 1 << NB;
int poz[B], nr[B], aux[N], cif, v[N];

int main()
{
    int n;
    ll a, b, c;
    in >> n >> a >> b >> c;
    int p = 1;
    v[0] = b;
    for(int i = 1; i < n; i++){
        v[i] = (a * v[i - 1] + b) % c;
    }
    for(int k = 0; k < NC; k++){
        int nb = k * NB;
        for(int j = 0; j < B; j++){
            nr[j] = 0;
        }
        for(int i = 0; i < n; i++){
            int cif = (v[i] >> nb) & (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[i] >> nb) & (B - 1);
            aux[poz[cif]++] = v[i];
        }
        for(int i = 0; i < n; i++){
            v[i] = aux[i];
        }
        p *= B;
    }
    for(int i = 0; i < n; i += 10){
        out << v[i] << " ";
    }

    return 0;
}