#include <bits/stdc++.h>
using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");
#define cin f
#define cout g

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

    int p = 0;
    for(int k = 0; k <= 32; k += 8) {
        vector<int> frecv(256, 0);
        int aux[n + 1];
        for(int i = 1; i <= n; i++) 
            frecv[(v[i] >> p) & 255]++;
        
        for(int i = 1; i < 256; i++) 
            frecv[i] += frecv[i - 1];
        
        for(int i = n; i >= 1; i--) {
            aux[frecv[(v[i] >> p) & 255]] = v[i];
            frecv[(v[i] >> p) & 255]--;
        }

        for(int i = 1; i <= n; i++) 
            v[i] = aux[i];

        p+=8;
    }

    for(int i = 1; i <= n; i += 10) {
        cout << v[i] << " ";
    }
    return 0;
}