#include<cstdio>
#include<cstring>
#define baza 10
using namespace std;
int i,Ap0,n,v[10000009];
struct nod
{
    int nr;
    nod *urm[baza];
    nod(){nr=0;memset(urm,0,sizeof(urm));}
}*q,*R[10];
void Read()
{
    int n,v=0,A,B,Cf,aux,nr,C[13];
    scanf("%d",&n);
    scanf("%d",&A);
    scanf("%d",&B);
    scanf("%d",&Cf);
    for(int i=1;i<=n;i++)
    {
        v=(1LL*v*A+B)%Cf;
        Ap0+=(v==0);
        aux=v;
        nr=0;
        while(aux)
        {
            C[++nr]=aux%baza;
            aux/=baza;
        }
        if(R[nr]==0) R[nr]=new nod;
        q=R[nr];
        for(int j=nr;j>=1;j--)
        {
            if(q->urm[C[j]]==0) q->urm[C[j]]=new nod;
            q=q->urm[C[j]];
        }
        q->nr++;
        //printf("%d ",v);
    }
}
void DFS(nod *q,int p)
{
    if(q==0) return ;
    for(i=1;i<=q->nr;i++)
        v[++n]=p;
    for(int i=0;i<baza;i++)
        if(q->urm[i]!=0)
            DFS(q->urm[i],p*10+i);
}
void Print()
{
    for(int i=1;i<=n;i+=10)
        printf("%d ",v[i]);
    printf("\n");
}
int main()
{
freopen("radixsort.in","r",stdin);
freopen("radixsort.out","w",stdout);
Read();
for(i=1;i<=Ap0;i++)
    v[++n]=0;
for(int i=1;i<=10;i++)
    DFS(R[i],0);
Print();
return 0;
}