#include<fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n,a,b,c,v[10000005],v2[10000005],bk[260];
void sort(int c);
int main()
{
    in>>n>>a>>b>>c;
    int i,start,d,last,max=0;
    v[1]=b;
    for(i=2;i<=n;++i)
    {
        v[i]=(1LL*a * v[i-1] + b) % c;
        if(v[i]>max) max=v[i];
    }
    for(i=0;i<=24;i+=8) sort(i);
    for(i=1;i<=n;i+=10) out<<v[i]<<' ';
    out<<'\n';
}
void sort(int c)
{
    int i;
    for(i=0;i<=256;++i)
    {
        bk[i]=0;
    }
    for(i=1;i<=n;++i)
    {
        bk[ (v[i]>>c) & 255 ]++;
    }
    for(i=1;i<=256;++i) bk[i]+=bk[i-1];

    for(i=n;i>=1;--i)
    {
        v2[ bk[ (v[i]>>c) & 255 ]-- ]=v[i];
    }
    for(i=1;i<=n;++i) v[i]=v2[i];
}