#include <fstream>

using namespace std;

const int NB = 16;
const int B = 1 << NB;
const int N = 1e7;

int v[2][N];
int nr[B];
int poz[B];

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

int main()
{
    int n, a, b, c;
    in >> n >> a >> b >> c;
    v[0][0] = b;
    for(int i = 1; i < n; i++){
        v[0][i] = ((long long)a * v[0][i-1] + b) % c;
    }
    for(int k = 0; k < 2; k++){
        int ic = k & 1;
        int ia = 1 - ic;
        int nsh = k * NB;
        for(int j = 0; j < B; j++){
            nr[j] = 0;
        }
        for(int i = 0; i < n; i++){
            nr[(v[ic][i] >> nsh) & (B - 1)]++;
        }
        poz[0] = 0;
        for(int j = 1; j < B; j++){
            poz[j] = poz[j-1] + nr[j-1];
        }
        for(int j = 0; j < n; j++){
            c = (v[ic][j] >> nsh) & (B - 1);
            v[ia][poz[c]++]=v[ic][j];
        }

    }
    for(int i = 0; i < n; i += 10){
        out << v[0][i] << " ";
    }
}