#include <cstdio>

using namespace std;

const int bucket=8,lim=(1<<bucket)-1;
int v[10000010],aux[10000010],vaz[lim+10],n;

int get_val(int x,int ind)
{
    return (x>>(bucket*ind))&lim;
}

void count_sort(int ind)
{
    for(int i=0;i<=lim;i++) vaz[i]=0;
    for(int i=1;i<=n;i++) vaz[get_val(v[i],ind)]++;
    for(int i=1;i<=lim;i++) vaz[i]+=vaz[i-1];
    for(int i=n;i;i--) aux[vaz[get_val(v[i],ind)]--]=v[i];
    for(int i=1;i<=n;i++) v[i]=aux[i];
}

int main()
{
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);
    int a,b,c;
    scanf("%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for(int i=2;i<=n;i++) v[i]=(1LL*v[i-1]*a+b)%c;
    for(int i=0;i<32/bucket;i++) count_sort(i);
    for(int i=1;i<=n;i+=10) printf("%d ",v[i]);
    return 0;
}