//Mateescu Serban-Corneliu FMI 135
//radixsort
#include <fstream>
#include <list>

#define BASE 255
#define POW 8

using namespace std;

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

void radix(int n, int *v, int mlen)
{
    list<int> bucket[BASE + 1];

    for (int i = 0; i <= mlen; i += POW)
    {
        for (int j = 0; j < n; j++)
            bucket[(v[j] >> i) & BASE].push_back(v[j]);

        int _n = 0;
        for (int j = 0; j <= BASE; bucket[j++].clear())
            for (list<int>::iterator k = bucket[j].begin(); k != bucket[j].end(); v[_n++] = *(k++));
    }
}

//void radix(long n, unsigned long *v, int mlen)
//{
//    unsigned long
//
//    for (int i = 0; i <= mlen; i += POW)
//    {
//        for (long j = 0; j < n; j++)
//            bucket[(v[j] >> i) & BASE].push_back(v[j]);
//
//        long _n = 0;
//        for (int j = 0; j <= BASE; bucket[j++].clear())
//            for (list<unsigned long>::iterator k = bucket[j].begin(); k != bucket[j].end(); v[_n++] = *(k++));
//    }
//}

int main()
{
    int n, a, b, c, m;

    f >> n;
    int v[n];

    f >> a >> b >> c;

    v[0] = b;
    m = v[0];
    for (int i = 1; i < n; i++)
    {
        v[i] = (1LL * a * v[i - 1] + b) % c;
        if (m < v[i])
            m = v[i];
    }

    int mlen = 0;
    while (m)
    {
        m >>= 1;
        mlen++;
    }

    radix(n, v, mlen);

    for (int i = 0; i < n; i += 10)
        g << v[i] << " ";

    return 0;
}