#include <bits/stdc++.h>

using namespace std;

FILE*f=fopen("radixsort.in","r");
FILE*g=fopen("radixsort.out","w");

queue<int> q[10];

int n,v[10000005],a,b,c;

int main() {
    int i,j,m;
    fscanf(f,"%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for (i=2;i<=n;i++)
        v[i]=(a*v[i-1]+b)%c;
    int p=1;
    for (i=1;i<=10;i++) {
        for (j=1;j<=n;j++)
            q[v[j]/p%10].push(v[j]);
        p*=10;
        m=0;
        for (j=0;j<10 && m<n;j++)
            while (!q[j].empty()) {
                v[++m]=q[j].front();
                q[j].pop();
            }
    }
    for (i=1;i<=n;i+=10)
        fprintf(g,"%d ",v[i]);
    return 0;
}