#include <bits/stdc++.h>

using namespace std;

int v[10000005],n,a,b,c;
long long masca[]={255,255 << 8, 255 << 16, 1LL*255<<24};
int shift[]={0,8,16,24};
queue <int > mat[256];


void creare()
{
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for (int i=2;i<=n;++i)
        v[i]=(1LL*a*v[i-1]+b)%c;
}
void sortare(int indice)
{
    for (int i=1;i<=n;++i)
        {
            int poz=(v[i]&masca[indice])>>shift[indice];
            mat[poz].push(v[i]);
        }
    int k=0;
    for (int i=0;i<=255;++i)
        while (!mat[i].empty())
            {
                v[++k]=mat[i].front();
                mat[i].pop();
            }
}
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    creare();
    for (int j=0;j<=3;j++)
        sortare(j);
    for (int i=1;i<=n;i+=10)
        printf("%d ",v[i]);
    return 0;
}