#include <fstream>
#define nmax 10000005
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[nmax],k[nmax],p[256];
int n,a,b,c;
int base;
long long basemax;
// baza 256
inline int cif(int r)
{
    return ((r>>(8*base))&255);
}

int main()
{
    int i,j;
    f>>n>>a>>b>>c;
    v[1]=b;
    basemax=4;
    for (i=2;i<=n;i++) {
        v[i]=(1LL* a * v[i-1]+b)%c;
    }

    base=0;
    while (base<basemax) {

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

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

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

        for (i=n;i>=1;i--) {
            k[p[cif(v[i])]--]=v[i];
        }
        for (i=1;i<=n;i++)
            v[i]=k[i];

        base++;
    }

    for (i=1;i<=n;i+=10) g<<v[i]<<' ';

    return 0;
}