#include <bits/stdc++.h>

using namespace std;

const int N = 1e7 + 5;
const int msk = (1 << 8) - 1;

int v[N], va[N];
int dp[msk];

int main(){
    ifstream fin("radixsort.in");
    ofstream fout("radixsort.out");
    int n, a, b, c;
    fin >> n >> a >> b >> c;
    v[1] = b;
    for(int i = 2;i <= n;i++){
        v[i] = (1LL * a * v[i - 1] + b) % c;
    }
    for(int shift = 0;shift < 32;shift += 8){
        for(int i = 1;i <= n;i++){
            dp[(v[i] >> shift)&msk]++;
        }
        for(int i = 1;i <= msk;i++){
            dp[i] += dp[i - 1];
        }
        for(int i = n;i >= 1;i--){
            va[dp[(v[i] >> shift)&msk]--] = v[i];
        }
        for(int i = 0;i <= msk;i++){
            dp[i] = 0;
        }
        for(int i = 1;i <= n;i++){
            v[i] = va[i];
        }
    }
    for(int i = 1;i <= n;i += 10){
        fout << v[i] << ' ';
    }
    return 0;
}