#include <fstream>

using namespace std;

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

const int N=10000000;
const int MOD=512;

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

struct info
{
    int x,r;
};

info v[N+5],aux[N+5];

int main()
{
    fin>>n>>a>>b>>c;
    v[1].x=v[1].r=b;
    for(int i=2;i<=n;i++)
    {
        v[i].x=((long long)a*v[i-1].x%c+b)%c;
        v[i].r=v[i].x;
    }
    while(1)
    {
        for(int i=0;i<MOD;i++)
            ap[i]=0;
        bool gasit=0;
        for(int i=1;i<=n;i++)
        {
            ap[v[i].r%MOD]++;
            if(v[i].r)
                gasit=1;
        }
        if(gasit==0)
            break;
        for(int i=1;i<MOD;i++)
            ap[i]+=ap[i-1];
        for(int i=1;i<=n;i++)
        {
            int val=v[i].r%MOD;
            aux[ap[val]]=v[i];
            ap[val]--;
        }
        for(int i=1;i<=n;i++)
        {
            v[i].x=aux[i].x;
            v[i].r=aux[i].r/MOD;
        }
    }
    for(int i=1;i<=n;i+=10)
    {
        fout<<v[i].x<<" ";
    }
    fout<<"\n";
    return 0;
}