#include <iostream>
#include<fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
const int MAX=1e7;
const int CIF=10;
int n;
long long nr[MAX];
long long cate[CIF],pos[CIF];
int nrnou[MAX];
void radixStep(int power){
        for(int d=0;d<CIF;d++)
            cate[d]=0;
        for(int i=0;i<n;i++)
            cate[nr[i]/power%10]++;
        pos[0]=0;
        for(int d=1;d<CIF;d++)
            pos[d]=pos[d-1]+cate[d-1];
        for(int i=0;i<n;i++){
            nrnou[pos[nr[i]/power%10]]=nr[i];
            pos[nr[i]/power%10]++;
        }
        for(int i=0;i<n;i++)
            nr[i]=nrnou[i];
}
void radixSort(void){
        long long maxValue;
        for(int i=0;i<n;i++)
            maxValue=max(maxValue,nr[i]);
        for(long long power=1;power<=maxValue;power*=10)
            radixStep(power);
}
int main()
{
    int a,b,c;
    in>>n>>a>>b>>c;
    nr[0]=b;
    for(int i=1;i<=n;i++){
        nr[i]=(1LL*a*nr[i-1]+b)%c;
    }
    radixSort();
    for(int i=0;i<n;i+=10)
        out<<nr[i]<<" ";
    return 0;
}