#include <algorithm>
#include <iostream>
#include <fstream>
using namespace std;

#define MAXN 10000005

ifstream f("radixsort.in");
ofstream g("radixsort.out");

int n, a, b, c;
int v[MAXN];

int main()
{
    f >> n >> a >> b >> c;

    int cur = b, prev;
    v[0] = b;

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

    sort(v + 1, v + n + 1);

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

    return 0;
}