#include <bits/stdc++.h>
#define NMAX 10000005
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int v[NMAX];
int v2[NMAX];
int f[11];
int n;
void countsort(int p10){
    memset(f,0,sizeof f);
    for(int i = 1; i <= n; i++) f[(v[i] / p10) % 10]++;
    for(int i = 1; i < 10; i++) f[i] += f[i - 1];
    for(int i = n; i >= 1; i--){
        v2[f[(v[i] / p10) % 10]] = v[i];
        f[(v[i] / p10) % 10]--;
    }
     for(int i = 1; i <= n; i++) v[i] = v2[i];
}
void radixsort_dec(int m){
    int exp = 0,p10 = 1;
    while(m){
        m /= 10;
        exp++;
    }
    for(int i = 0; i <= exp; i++){
        countsort(p10);
        p10 *= 10;
    }
}
int main()
{
    int i,a,b,c;
    fin >> n >> a >> b >> c;
    int m = v[1] = b;
    for(i = 2; i <= n; i++){
        v[i] = (a * v[i - 1] + b) % c;
        m = max(v[i],m);
    }
    radixsort_dec(m);
    for(i = 1; i <= n; i += 10) fout << v[i] << " ";
    return 0;
}