#include <fstream>
#include <vector>
#include <iostream>

using namespace std;

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

const int bucket = (1 << 8);
const int bits = 8;
const int totalbits = 32;
const int mask = (1 << 8) - 1;

inline void radixsort(vector <int> &v, int n) {
    vector <int> act(n);
    for(int step = 0 ; step <= totalbits - bits ; step += bits) {
        vector <int> cnt(bucket, 0);
        for(int i = 0 ; i < v.size() ; ++ i)
            ++ cnt[(v[i] >> step) & mask];
        for(int i = 1 ; i < bucket ; ++ i)
            cnt[i] += cnt[i - 1];
        for(int i = v.size() - 1 ; i >= 0; -- i)
            act[--cnt[(v[i] >> step) & mask]] = v[i];
        v = act;
    }
}

int main() {
    int n, a, b, c;
    vector <int> v;
    fin >> n >> a >> b >> c;
    v.push_back(b);
    for(int i = 1 ; i < n;  ++ i)
        v.push_back((1LL * a * v.back() + b) % c);
    radixsort(v, n);
    for(int i = 0 ; i < n ; i += 10)
        fout << v[i] << ' ';
}