#include <bits/stdc++.h>
#define Byte (1 << 8)

using namespace std;

int v[10000005], n, maxim, a, b, c;

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

void Citire()
{
    maxim = -1;

    fin >> n >> a >> b >> c;

    v[1] = b;
    for(int i = 2; i <= n; i++)
    {
        v[i] = (1LL * a * v[i - 1] % c + b) % c;
        maxim = max(maxim, v[i]);
    }
}

int frecv[Byte];

void CountSort(int ar[], int n, int f)
{
    int aux[n + 2];

    for(int i = 0; i < Byte; i++)
        frecv[i] = 0;

    for(int i = 1; i <= n; i++)
    {
        int val = ar[i] / (1 << (f * 8)) % (Byte - 1);
        frecv[val]++;

    }

    for(int i = 1; i <= Byte; i++)
        frecv[i] += frecv[i - 1];

    for(int i = Byte; i >= 1; i--)
        frecv[i] = frecv[i - 1];
    frecv[0] = 0;

    for(int i = 1; i <= n; i++)
    {
        int val = ar[i] / ( 1 << (f * 8)) % (Byte - 1);
        aux[frecv[val] + 1] = ar[i];
        frecv[val]++;
    }

    ///transferam valorile in vectorul initial
    for(int i = 1; i <= n; i++)
        ar[i] = aux[i];
}

void RadixSort()
{
    for(int i = 0; i < 4; i++)
        CountSort(v, n, i);
}

int main()
{
    Citire();
    RadixSort();
    for(int i = 1; i <= n; i += 10)
        fout << v[i] << " ";
    return 0;
}