#include <fstream>

using namespace std;

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

const int N=10000000;
const int MOD=(1<<15);

int n;
int a,b,c;
int v[N+5],aux[N+5];
int ap[MOD+5];

int main()
{
    fin>>n>>a>>b>>c;
    v[1]=b;
    for(int i=2;i<=n;i++)
        v[i]=((long long)v[i-1]*a+b)%c;
    for(int p=0;p<32;p+=15)
    {
        for(int i=0;i<MOD;i++)
            ap[i]=0;
        for(int i=1;i<=n;i++)
            ap[(v[i]>>p)%MOD]++;
        for(int i=1;i<MOD;i++)
            ap[i]+=ap[i-1];
        for(int i=n;i>=1;i--)
        {
            aux[ap[(v[i]>>p)%MOD]]=v[i];
            ap[(v[i]>>p)%MOD]--;
        }
        for(int i=1;i<=n;i++)
            v[i]=aux[i];
    }
    for(int i=1;i<=n;i+=10)
        fout<<v[i]<<" ";
    fout<<"\n";
    return 0;
}