#include <fstream>
#include <queue>
#include <vector>

using namespace std;

vector<int> Generate(int n, int a, int b, int c) {
    vector<int> vec(n);
    vec[0] = b;

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

void Sort(vector<int>& vec) {
    int div = 1;
    int mod = 100;

    vector<queue<int>> buckets(100);
    for (const auto& num : vec) {
        buckets[0].push(num);
    }

    for (int i = 0; i < 5; i += 1) {
        vector<queue<int>> new_buckets(mod);
        for (auto& b : buckets) {
            while (!b.empty()) {
                auto num = b.front();
                b.pop();
                new_buckets[(num / div) % mod].push(num);
            }
        }

        div *= mod;
        buckets = new_buckets;
    }

    int index = 0;
    for (auto& b : buckets) {
        while (!b.empty()) {
            vec[index] = b.front();
            index += 1;
            b.pop();
        }
    }
}

int main() {
    ifstream fin("radixsort.in");
    ofstream fout("radixsort.out");

    int n, a, b, c;
    fin >> n >> a >> b >> c;

    auto vec = Generate(n, a, b, c);

    Sort(vec);

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

    return 0;
}