#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

const int nMax = 10000008;
const int base = 256;

inline int GetMax(const vector<int> &v)
{
    int n = v.size();
    int ret = v[1];
    for(int i = 2; i <= n; ++i)
        ret = max(ret, v[i]);
    return ret;
}

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 + 1);
    vector<int> cnt(base, 0);
    for(int i = 1; i <= n; ++i)
        cnt[GetDigit(v[i], digit)]++;
    for(int i = 1; i < base; ++i)
        cnt[i] = cnt[i-1] + cnt[i];
    for(int i = n; i >= 1; --i)
        temp[cnt[GetDigit(v[i], digit)]--] = v[i];
    for(int i = 1; i <= n; ++i)
        v[i] = temp[i];
}

void radix_sort(vector<int> &v)
{
    int n = v.size();
    long long mx = GetMax(v);

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

int main()
{
    int n, a, b, c;
    ifstream in("radixsort.in");
    in >> n >> a >> b >> c;
    in.close();
    vector<int> v(n + 1);
    v[1] = b;
    for(int i = 2; i <= n; ++i)
        v[i] = (1LL * a * v[i-1] + b) % c;
    radix_sort(v);
    ofstream out("radixsort.out");
    for(int i = 1; i <= n; i += 10)
        out << v[i] << " ";
    return 0;
}