#include<fstream>
#include<vector>
#include<algorithm>
#define R 65536//2^16
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000002],w[10000002];
vector<int>a[R+2];
int main()
{
    int n,i,maxim,j,l,k;
    long long p=1,A,B,C;
    f>>n>>A>>B>>C;
    v[1]=B;
    w[1]=1;
    maxim=v[1];
    for(i=2;i<=n;i++)
        v[i]=((long long)v[i-1]*A+B)%C,w[i]=i,maxim=max(maxim,v[i]);
    while(p<=maxim)
    {
        for(i=1;i<=n;i++)
            a[(v[w[i]]/p)%R].push_back(w[i]);
        k=0;
        for(i=0;i<R;i++)
        {
            l=a[i].size();
            for(j=0;j<l;j++)
                w[++k]=a[i][j];
            a[i].clear();
        }
        p*=R;
    }
    for(i=1;i<=n;i+=10)
        g<<v[w[i]]<<" ";
    return 0;
}