#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
FILE*in=fopen("radixsort.in","r");
FILE*out=fopen("radixsort.out","w");
queue<int> w[4];
int n,a,b,c,i,maxx,po=0,ct,j;
int v[10000009];
int main()
{
    fscanf(in,"%d%d%d%d",&n,&a,&b,&c);
    v[0]=b;
    maxx=b;
    for(i=1;i<n;i++)
    {
        v[i]=(a*v[i-1]+b)%c;
        maxx=max(maxx,v[i]);
    }
    while((1<<po)<=maxx)
    {
        for(i=0;i<n;i++)
        {
            w[(v[i]>>po)%4].push(v[i]);
        }
        ct=0;
        for(i=0;i<4;i++)
        {
            while(!w[i].empty())
            {
                v[ct]=w[i].front();
                w[i].pop();
                ct++;
                if(ct>10000009)
                {
                    return 0;
                }
            }
        }
        po+=2;
    }
    for(i=0;i<n;i+=10)
    {
        fprintf(out,"%d ",v[i]);
    }
}