#include <bits/stdc++.h>
typedef unsigned long long ul;
typedef long long ll;
using namespace std;

ll n, a, b, c;

ll getMax(ll arr[], ll n)
{
    ll mx = arr[0];
    for (ll i = 1; i < n; i++)
        if (arr[i] > mx)
            mx = arr[i];
    return mx;
}

void countSort(ll arr[], ll n, ll exp)
{
    ll output[n];
    ll i, count[10] = {0};

    for (i = 0; i < n; i++)
        count[ (arr[i]/exp)%10 ]++;

    for (i = 1; i < 10; i++)
        count[i] += count[i - 1];


    for (i = n - 1; i >= 0; i--)
    {
        output[count[ (arr[i]/exp)%10 ] - 1] = arr[i];
        count[ (arr[i]/exp)%10 ]--;
    }

    for (i = 0; i < n; i++)
        arr[i] = output[i];
}

void radixSort(ll arr[], ll n)
{

    ll m = getMax(arr, n);

    for (ll exp = 1; m/exp > 0; exp *= 10)
        countSort(arr, n, exp);
}

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

int main(){
ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");

cin >> n >> a >> b >> c;
ll v[n];
create(v, n);

radixSort(v, n);

for (ll i = 0; i < n; i += 10) cout << v[i] << " ";

return 0;
}