#include <fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
const int rise=256;
int v[10000001],n,cnt[rise+1],aux[10000001],MaxVal;
void sorteaza(int MOD)
{
    int i;
    for(i=1; i<=n; i++)
        cnt[v[i]/MOD%rise]++;
    for(i=1; i<rise; i++)
        cnt[i]+=cnt[i-1];
    for(i=n; i>=1; i--)
        aux[cnt[v[i]/MOD%rise]--]=v[i];
    for(i=1; i<=n; i++)
        v[i]=aux[i];
}
void radixsort()
{
    for(int put=1; put<=MaxVal; )
    {
        sorteaza(put);
        for(int i=0; i<rise; i++)
            cnt[i]=0;
        if(put>MaxVal/rise)
            break;
        put*=rise;
    }
}
int main()
{
    int a,b,c,i;
    in>>n>>a>>b>>c;
    v[1]=b;
    MaxVal=b;
    for(i=2; i<=n; i++)
    {
        v[i]=(1LL*a*v[i-1]+b)%c;
        MaxVal=max(MaxVal,v[i]);
    }
    radixsort();
    for(i=1; i<=n; i+=10)
        out<<v[i]<<" ";
    return 0;
}