#include <iostream>
#include <fstream>
#include <cassert>

using namespace std;

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

inline int GetMax(int v[], int n)
{
    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 / (1LL << (d << 3))) & 0xFF;
}

void count_sort(int v[], int n, int digit)
{
    static int temp[nMax];
    static int cnt[base];

    for(int i = 0; i < base; ++i)
        cnt[i] = 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(int v[], int n)
{
    long long mx = GetMax(v, n);

    for(long long i = 0; (1LL << (i << 3)) <= mx; ++i)
        count_sort(v, n, i);
}

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