#include <cstdio>
#include <algorithm>
using namespace std;
int a[10000007],b,c,x,n,i;
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d %d %d %d",&n,&x,&b,&c);
    for(i=1;i<=n;i++)
    {
        if(i==1)
            a[i]=b;
        else a[i]=(x*a[i-1]+b)%c;
    }
    sort(a+1,a+n+1);
    for(i=1;i<=n;i+=10)
    printf("%d ",a[i]);
    return 0;
}