#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
unsigned int v[10000100];

bool sortUnit(int z, int n)
{
    bool sem = 1;
    int crtc;
    vector<unsigned int> vList[513];

    for(int i = 0; i <= 511; i++)
        vList[i].push_back(0);

    for(int i = 1; i <= n; i++){
        crtc = (v[i] << (24 - z) ) >> 24;
        vList[crtc][0] += 1;
        vList[crtc].push_back(v[i]);
    }
    int k = 0, j;
    for(int i = 0; i <= 511; i++){
        for(j = 1; j <= vList[i][0]; j++)
            v[++k] = vList[i][j];
    }

    return sem;
}

int main()
{
    int n, a, b, c;
    fin >> n >> a >> b >> c;

    v[1] = b;
    for(int i = 2; i <= n; i++) v[i] = (a * v[i - 1] + b) % c;

    unsigned int z = 0;
    while(sortUnit(z, n) && z <= 24)
        z = z + 8;

    for(int i = 1; i <= n; i += 10)fout << v[i] << " ";

    return 0;
}