#include <iostream>
#include <cstring>
#include <fstream>
#define NMAX 10000000

using namespace std;
using ll = long long;

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

int n, a, b, c;
ll arr[NMAX], out[NMAX];
int freq[10];

int numberOfDigits(ll x) {
    int counter = 0;
    while (x) {
        ++counter;
        x /= 10;
    }
    return counter;
}

void generateArray(ll &mx) {
    arr[0] = b;
    for (int i = 1; i < n; ++i) {
        arr[i] = (a * arr[i - 1] + b) % c;
        if (mx < arr[i]) mx = arr[i];
    }
}

int main()
{
    ll mx = 0;

    fin >> n >> a >> b >> c;
    generateArray(mx);

    int k = numberOfDigits(mx);
    ll power = 1;

    for (int digit = 1; digit <= k; ++digit) {
        memset(freq, 0, sizeof(freq));
        for (int i = 0; i < n; ++i) ++freq[(arr[i] / power) % 10];
        for (int i = 1; i <= 10; ++i) freq[i] += freq[i - 1];
        for (int i = n - 1; i >= 0; --i) {
            out[freq[(arr[i] / power) % 10] - 1] = arr[i];
            --freq[(arr[i] / power) % 10];
        }
        for (int i = 0; i < n; ++i) arr[i] = out[i];
        power *= 10;
    }

    for  (int i = 0; i < n; i += 10) fout << arr[i] << " ";

    fin.close();
    fout.close();
    return 0;
}