#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
ifstream f("radixsort.in" );
ofstream g("radixsort.out");

int N, cmax;
unsigned int v[10000001];
unsigned int group[10][10000001];

int NrCif(int x)
{
    int ncif = 0;
    while ( x ) {
        x/=10;
        ncif++;
    }
    return ncif;
}

void GenerateArray()
{
    int A, B, C;
    f >> N >> A >> B >> C;

    v[1] = B;
    for ( int i=2; i<=N; i++ ) {
        v[i] = (A * v[i-1] + B) % C;
        cmax = max(cmax, NrCif(v[i]));
    }
}

inline int Cif(int x, int pos) {
    for ( int i=1; i<pos; i++ )
        x /= 10;
    return x%10;
}


void RadixSort(unsigned int v[], int N)
{
    for ( int nPas=1; nPas<=cmax; nPas++ ) {
        for ( int i=1; i<=N; i++ )
        {
            int cifra = Cif(v[i], nPas);
            group[cifra][++group[cifra][0]] = v[i];
        }

        int k = 0;
        for ( int j=0; j<10; j++ )
        {
            for ( int i=1; i<=group[j][0]; i++ )
                v[++k] = group[j][i];
            group[j][0] = 0;
        }
    }
}


int main()
{
    GenerateArray();
    RadixSort(v, N);

    for ( int i=0; i*10+1<=N; i++ )
        g << v[i*10+1] << ' ';
}