#include <iostream>
#include <fstream>
#include <bitset>

using namespace std;

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

int v[10000002];

void radixSort(int v[],int dim)
{
    int i,j,ind[256],aux[dim],temp;
    int fr[256] = {0};
    for(j=0; j<dim; j++)
    {
        fr[v[j]]++;
        aux[j] = v[j];
    }
    ind[0] = 0;
    for(j=1; j<256; j++)
    {
        ind[j] = ind[j-1] + fr[j-1];
    }
    for(j=0; j<dim; j++)
    {
        temp = aux[j];
        v[ind[temp]] = aux[j];
        ind[temp]++;
    }
}

int main()
{
    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++)
    {
        g<<v[i]<<" ";
    }
    return 0;
}