#include <fstream>

using namespace std;
unsigned long long int v[10000000];
unsigned long long int maxim(unsigned long long int a[], unsigned long long int n)
{
    unsigned long long int maxi = a[0];
    for (unsigned long long int i = 1; i < n; i++)
        if (a[i] > maxi)
            maxi = a[i];
    return maxi;
}

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

void radixsort(unsigned long long int a[], unsigned long long int n)
{
    unsigned long long int m = maxim(a, n);
    for (unsigned long long int exp=1;m/exp>0;exp*=10)
        countSort(a, n, exp);
}
int main()
{
    ifstream f("radixsort.in");
    ofstream g("radixsort.out");
    unsigned long long int n,a,b,c,i;
    f>>n>>a>>b>>c;
    v[0]=b;
    for(i=1;i<n;i++)
        v[i]=(a*v[i-1]+b)%c;

        radixsort(v,n);
    for(i=0;i<n;i+=10)
        g<<v[i]<<' ';

    return 0;
}