#include <bits/stdc++.h>
#define mod (1<<8)
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,v[10000002],w[10000002],i,p;
int fr[257];
int getCif(int x)
{
    return (x>>p)%mod;
}
int main()
{
    long long a,b,c;
    fin>>n>>a>>b>>c;
    v[1]=b;
    for(i=2; i<=n; i++)
        v[i]=(a*v[i-1]+b)%c;
  //  for(i=1;i<=n;i++)
   //     cout<<v[i]<<" ";
    for(p=0; p<=24; p+=8)
    {
        memset(fr,0,sizeof(fr));
        fr[0]=1;
        for(i=1; i<=n; i++)
            fr[getCif(v[i])+1]++;
        for(i=1; i<=256; i++)
            fr[i]+=fr[i-1];
        for(i=1; i<=n; i++)
        {

            w[fr[getCif(v[i])]++]=v[i];
        }
        memcpy(v,w,sizeof(v));
    }
    for(i=1;i<=n;i+=10)
        fout<<v[i]<<" ";
}