#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int n, a, b, c, A[10000001];

int main()
{
    fin >> n >> a >> b >> c;
    A[1] = b;
    for (int i = 2; i <= n; ++i)
        A[i] = (a * A[i - 1] + b) % c;
    sort(A + 1, A + n + 1);
    for (int i = 1; i <= n; i += 10)
        fout << A[i] << " ";

    return 0;
}