#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
#define NMAX 10000005
vector<int> v;
int main()
{
    int n, a, b, c;
    fin >> n >> a >> b >> c;
    v.resize(n + 1);
    v[1] = b;
    for (int i = 2; i <= n; ++i)
    {
        v[i] = (1ll * a * v[i - 1] + b) % c;
    }
    sort(v.begin() + 1, v.end());
    for (int i = 1; i <= n; i = i + 10)
    {
        fout << v[i] << " ";
    }

    return 0;
}