#include <vector>
#include <cstdint>
#include <cstring>
#include <fstream>
#include <algorithm>

int main()
{
    int n, a, b, c;
    std::ifstream in("radixsort.in");

    if (in.is_open())
    {
        in >> n >> a >> b >> c;
        in.close();
    }

    std::vector<std::uint32_t> v(n, 0);

    v[0] = b;

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

    std::sort(v.begin(), v.end());

    std::ofstream out("radixsort.out");

    if (out.is_open())
    {
        for (int i = 0; i < n; i += 10)
        {
            out << v[i] << " ";
        }

        out.close();
    }
}