#include <fstream>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
long long n,a,b,c;
long  long v[10000001],maxim;
void citire()
{
    f>>n>>a>>b>>c;
    long long i;
    v[0]=b;
    maxim=b;
    for(i=1; i<=n; i++)
    {
        v[i] = (a * v[i-1] + b) % c;
        if (v[i] > maxim)
            maxim = v[i];
    }
}
void countSort(long long a[], long long n, long long exp)
{
    long long output[n];
    long long i, count[10] = {0};

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

    for (i = 1; i < 10; i++)
        count[i] += count[i - 1];

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

    for (i = 0; i < n; i++)
        a[i] = output[i];
}

void radixsort(long long a[],long n)
{



    for (long long exp = 1; maxim/exp > 0; exp *= 10)
        countSort(a, n, exp);
}
int main()
{
    citire();
    radixsort(v,n);
    long long i;
    for(i=0; i<n; i+=10)
        g<<v[i]<<" ";
    return 0;
}