#include <bits/stdc++.h>



using namespace std;



int v[10000010];



queue<int>l[256];



int n,a,b,c,i,j,k;



int main()

{

    freopen("radixsort.in","r",stdin);

    freopen("radixsort.out","w",stdout);



    scanf("%d%d%d%d",&n,&a,&b,&c);

    v[1]=b;

    for (i=2;i<=n;i++) v[i]=(1LL*v[i-1]*a+b)%c;



    for (i=0;i<=24;i+=8){

        for (j=1;j<=n;j++){

            l[(v[j]>>i)&255].push(v[j]);

        }

        k=0;

        for (j=0;j<=255&&k<n;j++){

            while (!l[j].empty()){

                k++;

                v[k]=l[j].front();

                l[j].pop();

            }

        }

    }

    for (i=1;i<=n;i+=10) printf("%d ",v[i]);

    return 0;

}