#include <bits/stdc++.h>
#define maxN 10000002
#define Mask (1 << 8) - 1
#define B 8
using namespace std;

FILE *fin = freopen("radixsort.in", "r", stdin);
FILE *fout = freopen("radixsort.out", "w", stdout);

int n;

int v[maxN][2];
int frq[Mask + 1], Nxt[Mask + 1];


int main()
{
    int a, b, c;
    scanf("%d%d%d%d", &n, &a, &b, &c);
    v[0][0] = b;
    for (int i = 1; i < n; ++ i)
        v[i][0] = (1LL * a * v[i - 1][0] + b) % c;
    for (int t = 0, dig = 0; dig < 4; ++ dig, t = !t)
    {
        for (int i = 0; i <= Mask; ++ i)
            frq[i] = Nxt[i] = 0;
        for (int i = 0; i < n; ++ i)
            ++ frq[(v[i][t] >> (B * dig)) & Mask];
        for (int i = 1; i <= Mask; ++ i) frq[i] += frq[i - 1];
        for (int i = 0; i < n; ++ i)
        {
            int val = (v[i][t] >> (B * dig)) & Mask;
            ++ Nxt[val];
            if (!val)
                v[Nxt[val] - 1][!t] = v[i][t];
            else
                v[Nxt[val] + frq[val - 1] - 1][!t] = v[i][t];
        }
    }
    for (int i = 0; i < n; i += 10)
        printf("%d ", v[i][0]);
    return 0;
}