#include<fstream>
#include<vector>
using namespace std;
#define base 10
#define nmax 10000010

ifstream cin("radixsort.in");
ofstream cout("radixsort.out");

int n,A,B,C,a[nmax],b[nmax];
int bucket[base];

int main()
{
    cin>>n>>A>>B>>C;
    a[1]=B;
    int m=-1,i;
    for (i=2;i<=n;i++) {
        long long l=(1LL*A*a[i-1]+B)%C;
        a[i]=l;
        m=(a[i]>m) ? a[i] : m;
    }

    for (int exp=1; exp<=m; exp*=base) {

        for (i=0;i<base;i++) bucket[i]=0;

        for (i=1;i<=n;i++)
            bucket[(a[i]/exp)%base]++;

        for (i=1;i<base;i++) bucket[i]+=bucket[i-1];

        for (i=n;i>0;i--)
            b[ bucket[(a[i]/exp)%base]-- ]=a[i];


        for (i=1;i<=n;i++) a[i]=b[i];
    }

    for (i=1;i<=n;i+=10) cout<<a[i]<<" ";
    return 0;
}