#include <iostream>
#include <fstream>
using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");
int maxim(int v[], int n)
{
    int maxi=v[1];
    for(int i=2; i<=n; i++)
        if(v[i]>maxi)
            maxi=v[i];
    return maxi;
}

void RadixSort0(int v[], int n, int exp)
{
    int output[n];
    int i, fr[10] = {0};
    for (i=0; i<n; i++)
        fr[(v[i]/exp)%10]++;
    for (i=1; i<10; i++)
        fr[i]+=fr[i-1];
    for (i=n-1; i>=0; i--)
    {
        output[fr[(v[i]/exp)%10]-1]=v[i];
        fr[(v[i]/exp)%10]--;
    }
    for(i=0; i<n; i++)
        v[i]=output[i];
}

void RadixSort(int v[], int n)
{
    int m=maxim(v, n);
    for(int exp=1; m/exp>0; exp*=10)
        RadixSort0(v,n,exp);
}
int i,n,a,b,c;
int main()
{
    f>>n>>a>>b>>c;
    int v[n]={0};
    v[1]=b;
    for(i=2; i<=n; i++)
        v[i]=((a*v[i-1])+b)%c;

    RadixSort(v,n+1);
    for(i=1; i<=n; i+=10)
        g<<v[i]<<" ";

    return 0;
}