#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "radixsort";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 10000000 + 5;

int N, A, B, C;
int V[NMAX];
int W[NMAX];
int bucket[(1 << 8) + 5];

void radix_sort(int lo, int hi) {
    int i;
    int mask, bits;
    int MASK = (1 << 8) - 1;

    for(bits = 0; bits < 32; bits += 8) {
        for(i = lo; i <= hi; i++) {
            mask = (V[i] >> bits)&MASK;
            bucket[mask]++;
        }

        for(i = 1; i <= MASK; i++)
            bucket[i] += bucket[i - 1];

        for(i = hi; i >= lo; i--) {
            mask = (V[i] >> bits)&MASK;
            W[bucket[mask]--] = V[i];
        }

        for(i = lo; i <= hi; i++)
            V[i] = W[i];

        memset(bucket, 0, sizeof(bucket));
    }
}

int main() {
    int i;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d%d%d", &N, &A, &B, &C);

    V[1] = B;

    for(i = 2; i <= N; i++)
        V[i] = (A * 1LL * V[i - 1] + B) % C;

    radix_sort(1, N);

    for(i = 1; i <= N; i += 10)
        printf("%d ", V[i]);

    return 0;
}