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

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


void qSort(int vector[],int st,int dr)
{
int temp,min,max,mijl;
mijl = vector[st+(dr-st)/2]; //luam mijlocul intervalului
min = st; max = dr;
do
{
while(vector[min] < mijl) min++;
while(vector[max] > mijl) max--;
if(min <= max) //interschimbare
{
temp = vector[min];
vector[min++] = vector[max];
vector[max--] = temp;
}
}while(min <= max); //la fiecare pas sortam "mai bine" intervalul st-dr
//cand numai avem ce face schimbam intervalul
if(st < max) qSort(vector,st,max); //crescator
if(dr > min) qSort(vector,min,dr); //crescator
}


int main()
{
    int n,a,b,c,v[100],i;
    f>>n>>a>>b>>c;
    for(i=1;i<=n;i++)
    {
        if(i==1)
            v[i]=b;
            else
            v[i]=(a*v[i-1]+b)%c;
    }
    qSort(v,1,n);
    for(i=1;i<=n;i=i+10)
        cout<<v[i]<<" ";
}