#include <cstdio>
#include <vector>

using namespace std;

int N, A, B, C;
vector <int> V;

void citire()
{
    long long x;
    scanf("%d %d %d %d", &N, &A, &B, &C);

    V.push_back(B);

    for (int i = 2; i <= N; ++i)
    {
        x = A * V.back() + B;
        V.push_back((int)(x % C));
    }
}

void rezolvare()
{
    int rez, mask = 255;
    vector <int> :: iterator it;
    vector <int> lista[260];

    for (int bucata = 0; bucata <= 3; ++bucata)
    {
        for (it = V.begin(); it != V.end(); ++it)
        {
            rez = (*it >> bucata * 8) & mask;
            lista[rez].push_back(*it);
        }
        V.clear();
        for (int i = 0; i <= 255; ++i)
        {
            for (it = lista[i].begin(); it != lista[i].end(); ++it)
            {
                V.push_back(*it);
            }
            lista[i].clear();
        }
    }

    for (it = V.begin(); it != V.end(); it += 10)
        printf("%d ", *it);
}

int main()
{
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);

    citire();
    rezolvare();

    return 0;
}