#include <fstream>
using namespace std;

const int MAXN = 1000001;

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

int v[MAXN];
int n;

void citire()
{
    int a,b,c;
    in >> n >> a >> b >> c;
    v[0] = b % c;
    for (int i = 1;i < n;++i)
        v[i] = (a * v[i - 1] + b) % c;
}

inline int bit(int nr, int byte)
{
    return (nr >> (byte * 8)) & 0xFF;
}

void countsort(int A[], int B[], int byte)
{
    int cnt[1 << 8] = {0};
    int index[1 << 8] = {0};

    for (int i = 0;i < n;++i)
        ++cnt[bit(A[i], byte)];

    index[0] = 0;
    for (int i = 1;i < (1 << 8);++i)
        index[i] = index[i - 1] + cnt[i - 1];

    for (int i = 0;i < n;++i)
        B[index[bit(A[i],byte)]++] = A[i];
}

void radixsort()
{
    int *temp = new int[n];
    for (int i = 0;i < sizeof(v[0]);++i)
        if (i % 2 == 0)
            countsort(v, temp, i);
        else countsort(temp, v, i);
}

void afisare()
{
    for (int i = 0;i < n;i += 10)
        out << v[i] << ' ';
    out << '\n';
}

int main()
{
    citire();
    radixsort();
    afisare();
    return 0;
}