#include <cstdio>
#include <vector>
using namespace std;
vector <int> a;
vector <int> sol[20];
vector <int> :: iterator it;
int i,j,l,x,b,c,n,y,m,w,q,m1;
int ncifre(int k)
{
    int nr=0;
    while(k!=0)
    {
        nr++;
        k/=10;
    }
    return nr;
}
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d %d %d %d",&n,&x,&b,&c);
    for(i=1 ; i<=n ; i++)
    {
        if(i==1)
            l=b;
        else l=(x*w+b)%c;
        a.push_back(l);
        y=max(y,l);
        w=l;
    }
    m=ncifre(y);
    x=1;
    for(i=1; i<=m; i++)
    {
        x=x*10;
        for(it=a.begin();it!=a.end();++it)
        {
            q=*it;
            m1=ncifre(q);
            if(q==(q%x) && q>=10 && m1<i)
            {
                sol[0].push_back(q);
            }
            else
            {
                sol[(q%x)/(x/10)].push_back(q);
            }
        }
        a.clear();
        for(j=0;j<=9;j++)
        {
            for(it=sol[j].begin();it!=sol[j].end();++it)
            {
                q=*it;
                a.push_back(q);
            }
            sol[j].clear();
        }
    }
    for(it=a.begin();it!=a.end();it+=10)
    {
        q=*it;
        printf("%d ",q);
    }
    return 0;
}