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

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

  long long v[10000000];

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

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

void radixsort( long long arr[],  long long n)
{
     long long m = getMax(arr, n);
    for ( long long exp = 1; m/exp > 0; exp *= 10)
        countSort(arr, n, exp);
}

void print( long long arr[],  long long n)
{
    for ( long long i = 0; i < n; i++)
        cout << arr[i] << " ";
}


int main()
{
     long long n,i;
    unsigned long long a,b,c;
    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=i+10)
        g<<v[i]<<" ";

    return 0;
}