#include <iostream>
#include <fstream>

using namespace std;

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

int v[10000005],b[10000005],N,i,mx,exp=1;
int radix=8; //impartim numarul in 4 bucket-uri de cate 8 biti
int modulo=(1<<radix)-1;

void countsort(int v[], int N, int exp) //sortam numerele dupa cel mai nesemnificativ bucket
{
    int i,c[300]={0};
    for(i=1;i<=N;i++)
        c[(v[i]>>exp)&modulo]++;
    for(i=1;i<=modulo;i++)
        c[i]=c[i]+c[i-1];
    for(i=N;i>=1;i--)
    {
        b[c[(v[i]>>exp)&modulo]]=v[i];
        c[(v[i]>>exp)&modulo]--;
    }
    for(i=1;i<=N;i++)
        v[i]=b[i];
}

void radixsort(int v[], int N)
{
    for (exp=0;exp<=24;exp=exp+8)
        countsort(v,N,exp);
}

int main()
{
    int A,B,C;
    f>>N>>A>>B>>C;
    v[1]=B;
    for(i=2;i<=N;i++)
        v[i]=(1LL*v[i-1]*A+B)%C;
    radixsort(v,N);
    for(i=1;i<=N;i=i+10)
        g<<v[i]<<" ";
    f.close(); g.close();
    return 0;
}