#include <stdio.h>
#include <algorithm>

using namespace std;

FILE*f=fopen("radixsort.in","r");
FILE*g=fopen("radixsort.out","w");

int v[10000002];

int main()
{
    int n,a,b,c,nr,i;
    fscanf(f,"%d%d%d%d",&n,&a,&b,&c);
    nr=b;
    for (i=1;i<=n;i++){
        //if (i%10==1)v[i/10+1]=nr;
        v[i]=nr;
        nr=(a*nr+b)%c;
    }
    sort(v+1,v+n+1);
    for (i=1;i<=n;i+=10) fprintf(g,"%d ",v[i]);
    fclose(f);
    fclose(g);
    return 0;
}