//https://www.infoarena.ro/problema/radixsort
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
int const MAX = 10000001;
int arr[MAX];
vector <pair<int, int>> buckets[100005];
vector <pair<int, int>> sorted;

void radix(int arr[], int n) {
    pair<int, int> keyNumber;
    int x = 100000;
    for (int i = 1; i <= n; ++i) {
        keyNumber.first = int(arr[i] / x);
        keyNumber.second = arr[i] % x;
        buckets[keyNumber.second].push_back({keyNumber.first, keyNumber.second});
    }
    for (int j = 0; j < x; ++j) {
        for (int k = 0; k < buckets[j].size(); ++k) {
            sorted.push_back(buckets[j][k]);
            
        }
        buckets[j].clear();
    }

    for (int i = 1; i <= n; ++i) {
        keyNumber.first = sorted[i].first;
        keyNumber.second = sorted[i].second;
        buckets[keyNumber.first].push_back({keyNumber.first, keyNumber.second});
    }
    for (int j = 0; j < x; ++j) {
        for (int k = 0; k < buckets[j].size(); ++k) {
            sorted.push_back(buckets[j][k]);
        }
        buckets[j].clear();
    }         
}

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

    int N, A, B, C;
    fin >> N >> A >> B >> C;
    arr[1] = B;

    for (int i = 2; i <= N; ++i) {
        arr[i] = (A * arr[i-1] + B) % C;
    }

    radix(arr, N);
    for (int i = 0; i < N; i += 10) {
        fout << sorted[i].first * 100000 + sorted[i].second << " ";
    }
}