#include <iostream>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");

int N,A,B,C;
vector<int> v;

int main()
{
    f>>N>>A>>B>>C;
    int last = B;
    v.push_back(last);
    for(int i=2;i<=N;i++){
        last = (int)(((long long) A * (long long)last + (long long)B) % (long long)C);
        v.push_back(last);
    }
    sort(v.begin(),v.end());
    for(int i=0;i<v.size();i+=10)
        g<<v[i]<<' ';
    return 0;
}