#include <bits/stdc++.h>
#define N 10000001

using namespace std;

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

int a[N], b[N], n, A, B, C;

void Citire()
{
    fin >> n >> A >> B >> C;
    a[1] = B;
    for (int i = 1; i <= n; i++)
        a[i] = (A * a[i - 1] + B) % C;
}

void CountSort(int ex)
{
    int cnt[10] = {0};
    for (int i = 1; i <= n; i++)
        cnt[a[i] / ex % 10]++;
    for (int i = 1; i < 10; i++)
        cnt[i] += cnt[i - 1];
    for (int i = n; i >= 1; i--)
    {
        b[cnt[a[i] / ex % 10]] = a[i];
        cnt[a[i] / ex % 10]--;
    }
    for (int i = 1; i <= n; i++)
        a[i] = b[i];
}

void RadixSort()
{
    int maxi = -1;
    for (int i = 1; i <= n; i++)
        if (a[i] > maxi)
            maxi = a[i];
    for (int i = 1; maxi / i != 0; i *= 10)
        CountSort(i);
}

void Afisare()
{
    for (int i = 1; i <= n; i += 10)
        fout << a[i] << " ";
}

int main()
{
    Citire();
    RadixSort();
    Afisare();
    return 0;
}