#include <fstream>
#include <algorithm>

using namespace std;

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

int N, A, B, C;
int V[10000000];

int main()
{
    fin >> 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)
        fout << V[i] << ' ';
    fout << '\n';

    fin.close();
    fout.close();
    return 0;
}