#include<iostream>
#include<fstream>
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n,a,b,c,v[2][10000005],bk[10],ok;
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]=(1LL*a * v[0][i-1] + b) % c;
    }
    int s,c;
    ok=1;
    for(s=0, c=1;ok;s=!s, c*=10)
    {
        ok=0;
        sort(s,c);
    }
    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]++; if((v[start][i]/c)%10) ok=1;}
    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];
    }
}