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

void radix(std::vector<int>& v, int n) {
    int maxval = -1;
    for (auto i : v) {
        if (maxval < i)
            maxval = i;
    }

    int radix = 1 << 16;
    for (long exp = 1; (maxval / exp) > 0; exp *= radix) {
        int i;
        std::vector<int> a(radix, 0), buff(n, 0);

        for (i = 0; i < n; i++)
            a[(v[i] / exp) % radix]++;
 
        for (i = 1; i < radix; i++)
            a[i] += a[i - 1];
 
        for (i = n - 1; i >= 0; i--) {
            buff[a[(v[i] / exp) % radix] - 1] = v[i];
            a[(v[i] / exp) % radix]--;
        }

        for (i = 0; i < n; i++)
            v[i] = buff[i];
    }
}

int main()
{
    std::ifstream f("radixsort.in");
    std::ofstream g("radixsort.out");
    std::vector<int> v(10000000, 0);

    int n, a, b, c;
    f >> n >> a >> b >> c;

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

    radix(v, n);

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