#include <bits/stdc++.h>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
long long n, a, b, c, x;
int cp[10000002], v[10000002], ma;

static inline void Sort(int put) {
    int fr[12];
    for(int i = 0; i < 10; i++) fr[i] = 0;

    for(int i = 0; i <  n; i++) fr[(v[i] / put) % 10]++;
    for(int i = 1; i < 10; i++) fr[i] += fr[i - 1];

    for(int i = n - 1; i >= 0; i--) {
        cp[fr[(v[i] / put) % 10] - 1] = v[i];
           fr[(v[i] / put) % 10]--;
    }

    for(int i = 0; i < n; i++) v[i] = cp[i];
}

int main() {
    fin.tie(nullptr);
    fout.tie(nullptr);

    fin >> n >> a >> b >> c;

    x = b;
    v[0] = x;
    ma = v[0];
    for(int i = 1; i < n; i++) {
        x = (long long)(a * x + b) % c;
        v[i] = x;
        ma = max(ma, v[i]);
    }

    for(int i = 1; ma / i > 0; i *= 10) Sort(i);

    for(int i = 0; i < n; i += 10) fout << v[i] << " ";
    fout << "\n";

    return 0;
}