#include <iostream>
#include <queue>
#include <fstream>
#include <map>
#include <cstring>
#include <stack>
#include <ctime>
#include <cstdlib>
#define N_MAX 1000005
#define MOD 666013
using namespace std;
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n, a, b, c;
int v[N_MAX];
int aux[N_MAX];
int fr[1 << 8];

void radix_sort_pb() {
    int* arr[2];
    arr[0] = v;
    arr[1] = aux;
    int index = 1;
    for (int d = 0; d < 32; d += 8) {
        memset(fr, 0, sizeof(fr));
        int* cur = arr[index ^ 1];
        int* next = arr[index];
        for (int i = 1; i <= n; i++) {
            fr[(cur[i] >> d) & 0xFF]++;
        }
        for (int i = 1; i < 256; i++) {
            fr[i] += fr[i - 1];
        }
        for (int i = n; i >= 1; i--) {
            int el = cur[i]; 
            int byte = (el >> d) & 0xFF;
            next[fr[byte]] = el;
            fr[byte]--;
        }
        index ^= 1;
    }
}

int main()
{
    in >> n >> a >> b >> c;
    v[1] = b;
    for (int i = 2; i <= n; i++) {
        v[i] = (a * v[i - 1] + b) % c;
    }

    radix_sort_pb();

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

    return 0;
}