#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;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#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 // HOME

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int MOD = (int)(1e9) + 7;

const int NMAX = 10000000 + 5;
const int MMAX = 100000 + 5;
const int KMAX = 100000 + 5;
const int PMAX = 100000 + 5;
const int LMAX = 100000 + 5;
const int VMAX = 100000 + 5;

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

void radix() {
    int i, j, mask, shft;

    mask = (1 << 8) - 1;
    shft = 0;

    for(i = 0; i < 4; i++, shft += 8) {
        memset(buckets, 0, sizeof(buckets));

        for(j = 1; j <= N; j++)
            buckets[(V[(i + 1) & 1][j] >> shft)&mask]++;

        for(j = 1; j <= mask; j++)
            buckets[j] += buckets[j - 1];

        for(j = N; j >= 1; j--)
            V[i & 1][buckets[(V[(i + 1) & 1][j] >> shft)&mask]--] = V[(i + 1) & 1][j];
    }
}

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][1] = B;

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

    radix();

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

    return 0;
}