#include <bits/stdc++.h>

using namespace std;

const int Byte = 256;

int n, v[10000005], a, b, c, maxim;

FILE* fin= fopen("radixsort.in","rt");
FILE* fout= fopen("radixsort.out","wt");

void Citire()
{
    maxim = -1;

    fscanf(fin,"%d %lld %lld %lld",&n,&a,&b,&c);

    v[1] = b;
    for(int i = 2; i <= n; i++)
    {
        v[i] = (1LL * a * v[i - 1] +1LL * b) % c;
        maxim = max(maxim, v[i]);
    }
}

void CountSort(int ar[], int n, int f)
{
    int frecv[Byte], i, aux[n + 2];

    for(i = 0; i < Byte; i++)
        frecv[i] = 0;

    for(i = 1; i <= n; i++)
        frecv[((ar[i] >> (f << 3)) & (Byte - 1))]++;

    for(i = 1; i < Byte; i++)
        frecv[i] += frecv[i - 1];

    for(int i = Byte - 1; i >= 1; i--)
        frecv[i] = frecv[i - 1];
    frecv[0] = 0;

    for(int i = 1; i <= n; i++)
        aux[(frecv[(ar[i] >> (f << 3)) & (Byte - 1)]++) + 1] = ar[i];

    for(int i = 1; i <= n; i++)
        ar[i] = aux[i];
}

void RadixSort()
{
    for(int i = 0; i < 4; i++)
        CountSort(v, n, i);
}

int main()
{
    Citire();
    RadixSort();
    for(int i = 1; i <= n; i += 10)
        fprintf(fout,"%d ",v[i]);
    return 0;
}