#include <fstream>
#include <string.h>
using namespace std;

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

static const int NMAX = 10000005;

int n, a, b, c;
int v[NMAX], k[NMAX], p[256];
int base, basemax;

inline int rest(int x)
{
    return (x >> (8*base)) & 255;
}

int main()
{
    int i,x;
    fin >> n >> a >> b >> c;
    v[1] = b;
    for(int i =2; i<= n; ++i){
        fin >> x;
        v[i] = (a * v[i-1] + b) % c;
    }
    base = 0;
    basemax = 4;
    while(base < basemax)
    {
        memset(p, 0, sizeof(p));

        for(i = 1; i<= n ;++i)
            p[rest(v[i])]++;

        for(i = 1; i <= 255; ++i)
            p[i]+= p[i-1];

        for(i = n; i>= 1; i--)
            k[p[rest(v[i])]--] = v[i];

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

    return 0;
}