#include<fstream>
#include<vector>
using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

const int Nmax=10000005;
const int MASK=(1<<16)-1;

int n,A,B,C;
int a[Nmax];
int cnt[MASK+5];
int b[Nmax],c[Nmax];

inline void RAD()
{
    int i,grad;
    bool test=0;
    for (grad=0;grad<=16;grad+=16)
        {
            if (test) for (i=0;i<=MASK;i++) cnt[i]=0;
            for (i=1;i<=n;i++)
                {
                    b[i]=(a[i]>>grad)&MASK;
                    cnt[b[i]]++;
                }
            test=1;
            for (i=1;i<=MASK;i++) cnt[i]+=cnt[i-1];
            for (i=n;i;i--) c[cnt[b[i]]--]=a[i];
            for (i=1;i<=n;i++) a[i]=c[i];
        }

}

int main()
{
    int i;
    fin>>n>>A>>B>>C;
    a[1]=B;
    for (i=1;i<=n;i++)  a[i]=(1LL*A*a[i-1]+1LL*B)%C;
    RAD();
    for (i=1;i<=n;i+=10) fout<<a[i]<<" ";
    fout<<"\n";
    return 0;
}