#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
int v[200],n,i,a,b,c;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int main(){
    f>>n>>a>>b>>c;
    v[0]=b;
    for(i=1;i<n;i++)
        v[i]=(a*v[i-1] + b) % c;
    sort(v,v + n);
    for(i=0;i<n;i=i+10)
        g<<v[i]<<" ";
    return 0;}