#include <bits/stdc++.h>

using namespace std;

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

long long n,A,B,C;
vector<int>ant[256],act[256];

int main()
{
    in >> n >> A >> B >> C;
    ant[1].resize(n);
    ant[1][0] = B;
    for (int i = 1; i < n; i++)
    {
        long long nr = (A * ant[1][i - 1] + B) % C;
        ant[1][i] = nr;
    }
    int p256 = 0;
    for (int q = 0; q <= 4; q++)
    {
        for (int i = 0; i < 256; i++)
            for (int j = 0; j < ant[i].size(); j++)
                act[(ant[i][j] >> p256) & 255].push_back(ant[i][j]);
        for (int i = 0; i < 256; i++)
            ant[i].clear(),ant[i].shrink_to_fit();
        for (int i = 0; i < 256; i++)
        {
            reverse(act[i].begin(),act[i].end());
            while (act[i].size())
            {
                ant[i].push_back(act[i][act[i].size() - 1]);
                act[i].pop_back();
            }
            act[i].shrink_to_fit();
        }
        p256 += 8;
    }
    for (int i = 0; i < n; i += 10)
        out << ant[i] << ' ';
    return 0;
}