#include <fstream>
#include <queue>
#include <cmath>
using namespace std;

#define LIM_MAX 10000005

long N, A, B, C;
long nr, nrcmax;
long m, n;
long i, j;
long vect[LIM_MAX];
queue<long> myQueue[10];

long nrcif(long x)
{
    nr = 0;

    while (x)
    {
        ++nr;
        x /= 10;
    }

    return nr;
}

void readData()
{
    ifstream in("radixsort.in");
    in >> N >> A >> B >> C;
    in.close();

    vect[1] = B;
    nrcmax = nrcif(vect[1]);

    for (i = 2; i <= N; ++i)
    {
        vect[i] = (A * vect[i - 1] + B) % C;
        nrcmax = nrcif(vect[i]) > nrcmax ? nrcif(vect[i]) : nrcmax;
    }
}

void printData()
{
    ofstream out("radixsort.out");

    for (i = 1; i <= N; i += 10)
        out << vect[i] << " ";

    out.close();
}

void radixSort()
{
    for (m = 10, n = 1; m <= pow(10, nrcmax); m *= 10, n *= 10)
    {
        for (i = 1; i <= N; ++i)
            myQueue[(vect[i] % m) / n].push(vect[i]);

        for (i = 0, j = 1; i <= 9; ++i)
            while (!myQueue[i].empty())
            {
                vect[j++] = myQueue[i].front();
                myQueue[i].pop();
            }
    }
}

int main()
{
    readData();
    radixSort();
    printData();

    return 0;
}