#include <bits/stdc++.h>
using namespace std;
ifstream fi("radixsort.in");
ofstream fo("radixsort.out");

int n, a, b, c;
int v[10000005];
int cnt[100005];
int main()
{
    fi >> n >> a >> b >> c;
    v[1] = b;
    for (int i = 2; i <= n; i++)
        v[i] = (a * v[i - 1] + b) % c;

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

    for (int i = 1; i <= n; i += 10)
        fo << v[i] << " ";

    return 0;
}