#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include<cmath>
using namespace std;

typedef long long int64;
typedef unsigned int uint;


main() {
    ifstream cin("radixsort.in");
    ofstream cout("radixsort.out");
    uint n, a, b, c;
    cin>>n>>a>>b>>c;
    //sqrtN buckets
    uint kn = round(sqrtl(c))+200;
    vector< vector<uint> > t(kn);
    //generate vector
    uint x = b;
    t[x/kn].push_back(x);
    for (uint i = 1; i<n; i++) {
        x = (a * (int64)x + b) % c;
        t[x/kn].push_back(x);
    }
    //sort buckets
    for (uint i = 0; i < t.size(); i++) {
        sort(t[i].begin(), t[i].end());
    }
    //show
    uint k = 0;
    for (uint i = 0; i < t.size(); i++) {
        if (t[i].size()) {
            for (uint j = 0; j < t[i].size(); j++) {
                k++;
                if (k%10==1) {
                    cout<<t[i][j]<<" ";
                }
            }
        }
    }

}