#include <cstdio>
#include <vector>

using namespace std;

int v[10000001];
vector <int> bucket[11];

int main() {
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);

    int n, a, b, c;
    scanf("%d%d%d%d", &n, &a, &b, &c);

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

    long long zece = 10;
    for(int cif = 1; cif <= 10; ++ cif, zece *= 10) {
        for(int i = 1; i <= n; ++ i) {
            int p = (1LL * v[i] % zece) / (zece / 10);
            bucket[p].push_back(v[i]);
        }

        int i = 1;
        for(int j = 0; j <= 9; ++ j) {
            for(int k = 0; k < bucket[j].size(); ++ k) {
                v[i] = bucket[j][k];
                ++ i;
            }
            bucket[j].clear();
        }
    }

    for(int i = 1; i <= n; i += 10) {
        printf("%d ", v[i]);
    }

    return 0;
}