#include <fstream>
#include  <queue>
#include <cmath>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000001];
int n,a,b,c,p=1,i,k,e,j,w,d,o;
queue <int> q[256];
int main()
{
    f>>n>>a>>b>>c;
    v[1]=b;
    d=b;
    k=log10(b)+1;
    o=1;
    for(i=2; i<=n; i++)
    {
        v[i]=(1LL*a*v[i-1]+b)%c;
        k=max(k,(int)log2(v[i])+1);
    }
    for(j=0; j<=k; j+=8){
        for(i=1; i<=n; i++)
            q[(v[i]>>j)&255].push(v[i]);
        e=0;
        for(w=0; w<=255&&e<=n; w++)
            while(!q[w].empty())
            {
                v[++e]=q[w].front();
                q[w].pop();
            }
    }
    for(i=1; i<=n; i+=10)
        g<<v[i]<<' ';
    return 0;
}