#include<fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int n,a,b,c;
long long v[10000001];

int getMax(long long a[], int n)
{
    int mx = a[0];
    for (int i = 1; i < n; i++)
        if (a[i] > mx)
            mx = a[i];
    return mx;
}

void countSort(long long a[], int n, int exp)
{
    int output[n];
    int i, countt[10] = {0};

    for (i = 0; i < n; i++)
        countt[ (a[i]/exp)%10 ]++;
   for (i = 1; i < 10; i++)
        countt[i] += countt[i - 1];

     for (i = n - 1; i >= 0; i--)
    {
        output[countt[ (a[i]/exp)%10 ] - 1] = a[i];
        countt[ (a[i]/exp)%10 ]--;
    }
    for (i = 0; i < n; i++)
        a[i] = output[i];
}

void radixsort(long long a[], int n)
{
     int m = getMax(a, n);

    for (int exp = 1; m/exp > 0; exp *= 10)
        countSort(a, n, exp);
}

int main()
{
    f>>n>>a>>b>>c;
    v[0]=b;
    for(int i=1;i<n;i++)
    {
        v[i]=(a*v[i-1]+b)%c;
    }
    radixsort(v,n);
    for(int i=0;i<n;i+=10)
    {
        g<<v[i]<<' ';
    }
    return 0;
}