#include <bits/stdc++.h>
using namespace std;
int n, a, b, c;
int v[10000001];
int ordored[10000001];
int countingSort[1 << 16];
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
void citire(){
    fin >> n >> a >> b >> c;
    v[1] = b;
    for(int i = 2; i <= n; i++)
        v[i] = (a * v[i - 1] + b) % c;
}
void RadixSort(int p, int n){
    int mask = (1 << 16) - 1;
    for(int i = 1;i <= (1 << 16); i++)
        countingSort[i] = 0;
    for(int i =1; i <= n; i++)
        countingSort[(v[i] >> (p * 16)) & mask] ++;
    for(int i = 1; i <= (1 << 16); ++i)
        countingSort[i] += countingSort[i - 1];

    for(int i = n; i >= 1; --i){
        ordored[countingSort[(v[i] >> (p * 16)) & mask]] = v[i];
        countingSort[(v[i] >> (p * 16)) & mask] -= 1;
    }
    for(int i = 1; i <= n; ++i) v[i] = ordored[i];
}
void afisare(){
    for(int i = 1; i <= n; i += 10)
        fout << v[i] << " ";
}
int main()
{
    citire();
    for(int i = 0; i <= 1; ++i)
        RadixSort(i, n);
    afisare();
    return 0;
}