#include<fstream>
#include<algorithm>
#define R 65535//2^16
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[2][10000002],a[R+2];

inline void rez()
{
    int n,i,maxim,x,k=0;
    long long p=1,A,B,C;
    f>>n>>A>>B>>C;
    v[0][1]=B;
    maxim=v[0][1];
    for(i=2;i<=n;i++)
        v[0][i]=((long long)v[0][i-1]*A+B)%C,maxim=max(maxim,v[0][i]);
    while(p<=maxim)
    {
        for(i=1;i<=n;i++)
        {
            x=(v[k%2][i]>>(k*16))&R;
            a[x]++;
        }
        for(i=1;i<=R;i++)
            a[i]+=a[i-1];
        for(i=n;i>=1;i--)
        {
            x=(v[k%2][i]>>(k*16))&R;
            v[(k+1)%2][a[x]]=v[k%2][i];
            a[x]--;
        }
        for(i=0;i<=R;i++)
            a[i]=0;
        p*=R;
        k++;
    }
    for(i=1;i<=n;i+=10)
        g<<v[k%2][i]<<" ";
}

int main()
{
    rez();
    return 0;
}