#include <cstdio>
#include <vector>
using namespace std;
vector <int> v[10];
vector <int> ::iterator it;
int n,A,b,c,a[10000005],x,i,div,j;
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d %d %d %d",&n,&A,&b,&c);
    a[1]=b;
    for (i=2; i<=n; i++)
    {
        x = (1LL*A* a[i-1] + b) % c;
        a[i]=x;
    }
    div=1;
    for (i=1; i<=9; i++)
    {
        for (j=1; j<=n; j++)
            v[(a[j]/div)%10].push_back(a[j]);
        a[0]=0;
        for (j=0; j<=9; j++)
            for(it=v[j].begin(); it!=v[j].end(); it++)
                a[++a[0]]=*it;
        for(j=0; j<=9; j++)
        {
            while(!v[j].empty())v[j].pop_back();
        }
        div*=10;
    }
    for (i=1; i<=a[0]; i+=10)
        printf("%d ",a[i]);
    return 0;
}