#include<iostream>
#include<fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n,a,b,c,v[2][10000000],bk[10];
void sort(int start,int c);
int main()
{
    in>>n>>a>>b>>c;
    int i;
    v[0][1]=b;
    for(i=2;i<=n;++i)
    {
        v[0][i]=(a * v[0][i-1] + b) % c;
    }
    sort(0,1);
    sort(1,10);
    sort(0,100);
    for(i=1;i<=n;i+=10)
    {
        out<<v[1][i]<<' ';
    }
    out<<'\n';
}
void sort(int start,int c)
{
    int i;
    for(i=0;i<=9;++i) bk[i]=0;
    for(i=1;i<=n;++i) bk[(v[start][i]/c)%10]++;
    for(i=1;i<=9;++i) bk[i]+=bk[i-1];
    for(i=n;i>=1;--i)
    {
        v[!start][bk[(v[start][i]/c)%10]--]=v[start][i];
    }
}