#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int nMax = 10000008;
const int base = (1 << 20);

inline int GetDigit(int x, int d)
{
    return (x / d) % base;
}

void count_sort(vector<int> &v, int digit)
{
    int n = v.size();
    vector<int> temp(n);
    vector<int> cnt(base, 0);
    for(auto x:v)
        cnt[GetDigit(x, digit)]++;
    for(int i = 1; i < base; ++i)
        cnt[i] = cnt[i-1] + cnt[i];
    for(int i = n-1; i >= 0; --i)
        temp[--cnt[GetDigit(v[i], digit)]] = v[i];
    v = temp;
}

void radix_sort(vector<int> &v)
{
    long long mx = *max_element(v.begin(), v.end());

    for(long long i = 1; mx / i > 0; i *= base)
        count_sort(v, i);
}

int main()
{
    int n, a, b, c;
    freopen("radixsort.in", "r", stdin);
    scanf("%d %d %d %d", &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;
    radix_sort(v);

    freopen("radixsort.out", "w", stdout);
    for(int i = 0; i < n; i += 10)
        printf("%d ", v[i]);
    return 0;
}