#include <bits/stdc++.h>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");

using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
#define pb push_back
const int NMax = 1e7 + 5;
const int inf = 1e9 + 5;
const int mod = 9973;
const int RADIX = 0b11111111;
using zint = int;

ll N,A,B,C;
int v1[NMax],v2[NMax];

void solve(int*,int*,int);

int main() {
    in>>N>>A>>B>>C;
    v1[1] = B;
    A %= C;
    B %= C;
    for (int i = 2;i <= N;++i) {
        v1[i] = (A * v1[i-1] + B) % C;
    }

    for (int i = 0;i < 4;++i) {
        if (i % 2 == 0) {
            solve(v1,v2,i);
        }
        else {
            solve(v2,v1,i);
        }
    }

    for (int i = 1;i <= N;i += 10) {
        out<<v1[i]<<' ';
    }

    in.close();out.close();
    return 0;
}

void solve(int* one,int* two,int byte) {
    int cnt[300] = {};
    for (int i = 1;i <= N;++i) {
        ++cnt[ (one[i]>>(8*byte)) & RADIX ];
    }

    int total = 0;
    for (int i = 0;i <= RADIX;++i) {
        int old = cnt[i];
        cnt[i] = total + 1;
        total += old;
    }

    for (int i = 1;i <= N;++i) {
        two[ cnt[(one[i]>>(8*byte)) & RADIX]++ ] = one[i];
    }
}