#include <cstdio>
#include <algorithm>

using namespace std;

int v[10000005],n,a,b,c;
int main()
{
    FILE*f=fopen("radixsort.in","r");
    FILE*g=fopen("radixsort.out","w");
    int i;
    fscanf(f,"%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for(i=2;i<=n;++i)
        v[i]=(a*v[i-1]+b)%c;
    sort(v+1,v+n+1);
    for(i=1;i<=n;i=i+10)
        fprintf(g,"%d ",v[i]);
    fclose(f);
    fclose(g);
    return 0;
}