#include <fstream>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
long long n,a,b,c;
int v[10000002],vmax,i,j,f[10],w[10000002],nr, p ;
int main()
{
    fin>>n>>a>>b>>c;
    v[1]=b;
    for(i=2;i<=n;i++){
        v[i]=int((long long)((a*v[i-1]+b)%c));
        if(v[i]>vmax)
            vmax=v[i];
    }

	nr = 0;
	while (vmax) {
		nr++;
		vmax = vmax/10;
	}


	p = 1;
	for (;nr--;p*=10) {
		for (i=0;i<=9;i++)
			f[i] = 0;
		for (i=1;i<=n;i++)
			f[ v[i]/p%10 ] ++;

		for (i=1;i<=9;i++)
			f[i] += f[i-1];

		for (i=n;i>=1;i--) {
			w[ f[v[i]/p%10]-- ] = v[i];

		}

		for (i=1;i<=n;i++)
			v[i] = w[i];

	}

	for (i=1;i<=n;i+=10)
		fout<<v[i]<<" ";


    return 0;
}