#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream cin ("radixsort.in" );
ofstream cout("radixsort.out");

int main()
{
    int n, a, b, c;
    cin >> n >> a >> b >> c;

    vector <int> x(n);
    x[0] = b;

    for (int i = 1; i < x.size(); i++)
        x[i] = (a * x[i-1] + b) % c;

    sort(x.begin(), x.end());

    for (int i = 0; i < x.size(); i+= 10)
        cout << x[i] << ' ';

    return 0;
}