#include <fstream>
#include <vector>

using namespace std;

int main()
{
    ifstream fin("radixsort.in");
    ofstream fout("radixsort.out");

    long long n, a, b, c;
    fin >> n >> a >> b >> c;

    vector<long long> v(n + 1);

    v[1] = b;
    for (long long i = 2; i <= n; ++i)
    {
        v[i] = (a * v[i - 1] + b) % c;
    }

    vector<long long> count(257, 0);
    for (long long j = 1; j <= 4; ++j)
    {
        for (long long i = 1; i <= n; ++i)
        {
            count[(v[i] & ((1LL << 8 * j) - 1)) >> (8 * (j - 1))]++;
        }

        for (long long i = 1; i < 256; ++i)
        {
            count[i] += count[i - 1];
        }

        vector<long long> sorted(n + 1);
        for (long long i = n; i >= 1; --i)
        {
            sorted[count[(v[i] & ((1LL << 8 * j) - 1)) >> (8 * (j - 1))]--] = v[i];
        }

        for (long long i = 1; i <= n; ++i)
        {
            v[i] = sorted[i];
        }

        count.assign(257, 0);
    }

    for (long long i = 1; i <= n; i += 10)
    {
        fout << v[i] << " ";
    }

    fout << "\n";
}