#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fi("radixsort.in");
ofstream fo("radixsort.out");

const int NRB = 4;
const int SIZEB = 8;

int n, a, b, c;
int v[10000005];
int v2[10000005];
int cnt[(1 << SIZEB) + 10];

void radixSort()
{
    ll p = 0;
    for (int rep = 1; rep <= NRB; rep++, p += SIZEB)
    {
        memset(cnt, 0LL, sizeof(cnt));

        for (int i = 1; i <= n; i++)
            cnt[((v[i] >> p) & ((1 << SIZEB) - 1)) + 1]++;

        for (int i = 1; i < (1 << SIZEB); i++)
            cnt[i] += cnt[i - 1];

        for (int i = 1; i <= n; i++)
        {
            int poz = cnt[((v[i] >> p) & ((1 << SIZEB) - 1))] + 1;
            v2[poz] = v[i];
            cnt[((v[i] >> p) & ((1 << SIZEB) - 1))]++;
        }
        for (int i = 1; i <= n; i++)
            v[i] = v2[i];
    }
}

int main()
{
    fi >> n >> a >> b >> c;
    v[1] = b;
    for (int i = 2; i <= n; i++)
        v[i] = (ll)(1LL * a * v[i - 1] + b) % c;
    /*fi >> n;
    for (int i = 1; i <= n; i++)
        fi >> v[i];*/

    radixSort();

    for (int i = 1; i <= n; i += 10)
        fo << v[i] << " ";

    return 0;
}