#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>
#include <cstring>

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

#define ll long long
#define ull unsigned long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e7 + 5;
const int nrBytes = 4;
const int bits = 8;
const int Radix = 0b11111111;

int N,A,B,C;
int v[NMax],aux[NMax];

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

int main() {
    in>>N>>A>>B>>C;
    v[1] = B;
    A %= C;
    B %= C;

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

    for (int i=0;i < nrBytes;++i) {
        if ((i & 1) == 0) {
            solve(v,aux,i);
        }
        else {
            solve(aux,v,i);
        }
    }

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

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

void solve(int* one,int* two,int byte) {
    int occ[Radix + 5] = {};

    for (int i=1;i <= N;++i) {
        ++occ[(one[i]>>(bits*byte)) & Radix];
    }

    ll total = 0;
    for (int i=0;i <= Radix;++i) {
        int old = occ[i];
        occ[i] = total + 1;
        total += old;
    }

    for (int i=1;i <= N;++i) {
        two[occ[(one[i]>>(bits*byte)) & Radix]++] = one[i];
    }
}