#include <cstdio>
#include <algorithm>
#define in "radixsort.in"
#define out "radixsort.out"

using namespace std;

const int NM = 1e7;

inline void swap(int &a,int &b)
{
    int aux = a;
    a = b;
    b = aux;
}

long long N,A,B,C;
int v[NM];

inline void QuickSort(const int &st,const int &dr)
{
    int mij = v[(st+dr)/2];

    int i,j;
    i = st,j = dr;

    while(i <= j)
    {
        while(v[i] < mij)
            ++i;
        while(v[j] > mij)
            --j;

        if(i <= j)
        {
            swap(v[i],v[j]);
            ++i;
            --j;
        }
    }

    if(i < dr) QuickSort(i,dr);
    if(st < j) QuickSort(st,j);
}

int main()
{
    FILE *fr = fopen(in,"r");
    FILE *fw = fopen(out,"w");

    fscanf(fr,"%d %d %d %d",&N,&A,&B,&C);

    v[1] = B;
    for(int i=2; i<=N; ++i)
        v[i] = (A*v[i-1] + B)%C;

    QuickSort(1,N);

    for(int i=1; i<=N; i+=10)
        fprintf(fw,"%d ",v[i]);

    fclose(fr); fclose(fw);
    return 0;
}