#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 50005;
const int inf = 1e9;

int getmax(vector <int> &v){
    int mx = v[0];

    for(int i = 1; i < v.size(); i++)
        mx = max(mx, v[i]);

    return mx;
}

void countingSort(vector <int> &v, int p){
    vector <int> otp(v.size());
    int cnt[10];

    for(int i = 0; i <= 9; i++)
        cnt[i] = 0;

    for(int i = 0; i < v.size(); i++)
        cnt[(v[i] / p) % 10]++;

    for(int i = 1; i <= 9; i++)
        cnt[i] += cnt[i - 1];

    for(int i = v.size() - 1; i >= 0; i--){
        otp[cnt[(v[i] / p) % 10] - 1] = v[i];
        cnt[(v[i] / p) % 10]--;
    }

    for(int i = 0; i < v.size(); i++)
        v[i] = otp[i];
}

void radixsort(vector <int> &v){
    int mx = getmax(v);

    for(int p = 1; mx / p > 0; p *= 10)
        countingSort(v, p);
}

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

    vector <int> v(n);

    v[0] = b;
    for(int i = 1; i < n; i++)
        v[i] = (1LL * a * v[i - 1] + b) % c;

    radixsort(v);

    for(int i = 0; i < n; i += 10)
        fout << v[i] << " ";

    return 0;
}