#include <iostream>
#include <fstream>
#include <queue>

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

int N;
int v[10000001];

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;
}

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

void RadixSort(int v[], int N)
{
    queue<int> group[10];
    int passes = 1;

    for ( int i=1; i<=N; i++ )
        passes = max(passes, NrCif(v[i]));

    for ( int nPas=1; nPas<=passes; nPas++ )
    {
        for ( int j=1; j<=N; j++ )
            group[Cif(v[j], nPas)].push(v[j]);

        int k = 0;
        for ( int j=0; j<=9; j++ )
            while ( !group[j].empty() ) {
                v[++k] = group[j].front();
                group[j].pop();
            }

    }

}


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

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