#include<fstream>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
    ifstream fin("radixsort.in");
    ofstream fout("radixsort.out");
    int n,a,b,c,v[100],i,j=0;
    fin>>n>>a>>b>>c;
    v[1]=b;
    for(i=2;i<=n;i++)
    {
        v[i]=(a*v[i-1]+b)%c;
    }
    sort(v,v+n);
    while(j<n)
    {
        fout<<v[j]<<" ";
        j=j+10;
    }
}