#include <bits/stdc++.h>
using namespace std;
const int B = 10;
int v[10000005];
int nr[10000005], poz[10000005], aux[10000005];
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int main()
{
    int n, a, b, c, p, k, j, i;
    in>>n>>a>>b>>c;
    v[1] = b;
    for(i = 2; i <= 10000000; i++)
        v[i] = (a * v[i - 1] + b) % c;
    p = 1;
    for(k = 1; k <= 8; k++)
    {
        for(j = 0; j < B; j++)
            nr[j] = 0;
        for(i = 1; i <= n; i++)
            nr[v[i] / p % 10]++;
        poz[0] = 0;
        for(i = 1; i < B; i++)
            poz[i] = poz[i - 1] + nr[i - 1];
        for(i = 1; i <= n; i++)
            aux[++poz[v[i] / p % 10]] = v[i];
        for(i = 1; i <= n; i++)
            v[i] = aux[i];
        p *= 10;
    }
    for(int i = 1; i <= n; i += 10)
    {
        out<<v[i]<<" ";
    }
    return 0;
}