#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
long long n, a, b, c;
vector<int> v(10000000);
vector<queue<int>> bucket(256);
void calc_vec(int n, int a, int b, int c)
{
    v[0] = b;
    for (int i = 1; i < n; i++)
        v[i] = (a * v[i - 1] + b) % c;
}
int main()
{
    ifstream f("radixsort.in");
    ofstream g("radixsort.out");
    f >> n >> a >> b >> c;
    calc_vec(n, a, b, c);
    for (int p = 0; p < 32; p += 8)
    {
        for (int i = 0; i < n; i++)
            bucket[(v[i] >> p) & 255].push(v[i]);
        for (int i = 0, j = 0; i < 256; i++)
            while (!bucket[i].empty())
            {
                v[j ++] = bucket[i].front();
                bucket[i].pop();
            }
    }
    for (int i = 0; i < n; i = i + 10)
        g << v[i] << " ";
    return 0;
}