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


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