#include <bits/stdc++.h>

using namespace std;

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

long long n,A,B,C;
vector<int>a,b[2048];

int main()
{
    in >> n >> A >> B >> C;
    a.resize(n);
    a[0] = B;
    for (int i = 1; i < n; i++)
        a[i] = 1ll * (A * a[i - 1] + B) % C;
    int p256 = -11;
    for (int q = 0; q < 3; q++)
    {
        p256 += 11;
        for (int i = 0; i < n; i++)
            b[(a[i] >> p256) & 2047].push_back(a[i]);
        a.clear();
        for (int i = 0; i < 2048; i++)
        {
            for (int j = 0; j < b[i].size(); j++)
                a.push_back(b[i][j]);
            b[i].clear();
        }
    }
    for (int i = 0; i < n; i += 10)
        out << a[i] << ' ';
    return 0;
}