#include <bits/stdc++.h>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n, a, b, c, v[10000002];
deque<int> bk[12];

static inline void Sort(int put) {
    for(int i = 0; i <= 9; i++) bk[i].clear();

    for(int i = 1; i <= n; i++) {
        bk[v[i] / put % 10].push_back(v[i]);
    }

    int m = 0;
    for(int i = 0; i <= 9; i++) {
        for(auto it : bk[i]) v[++m] = it;
    }
}

static inline void Radix() {
    int put = 1;
    for(int i = 1; i <= 10; i++) {
        Sort(put);
        put *= 10;
    }
}

int main() {
    fin >> n >> a >> b >> c;

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

    Radix();

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

    return 0;
}