#include <bits/stdc++.h>
#define MAX 10000000
#define BUCKET 256
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,a,b,c,i,j,v[MAX+5],aux;
int b1[260],b2[260],b3[260],b4[260];
void Sort(){
    for(i=1;i<=n;i++){
        b1[v[i]%BUCKET]++;
        b2[v[i]/BUCKET%BUCKET]++;
        b3[v[i]/BUCKET/BUCKET%BUCKET]++;
        b4[v[i]/BUCKET/BUCKET/BUCKET%BUCKET]++;
    }
    j = 0;
    aux = 1;
    for(i=0;i<BUCKET;i++){
        while(b1[i]){
            b1[i]--;
            v[++j] = i;
        }
    }
    j = 0;
    aux *= BUCKET;
    for(i=0;i<BUCKET;i++){
        while(b2[i]){
            b2[i]--;
            v[++j] += i*aux;
        }
    }
    j = 0;
    aux *= BUCKET;
    for(i=0;i<BUCKET;i++){
        while(b3[i]){
            b3[i]--;
            v[++j] += i*aux;
        }
    }
    j = 0;
    aux *= BUCKET;
    for(i=0;i<BUCKET;i++){
        while(b4[i]){
            b4[i]--;
            v[++j] += i*aux;
        }
    }
}
int main()
{
    fin>>n>>a>>b>>c;
    v[1] = b;
    for(i=2;i<=n;i++)
        v[i] = (1LL * a * v[i-1] + b) % c;
    Sort();
    for(i=1;i<=n;i+=10)
        fout<<v[i]<<' ';
    return 0;
}