#include <bits/stdc++.h>
using namespace std;
long long n,i,v[10000003],a,b,c;
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%lld%lld%lld%lld",&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)
        printf("%lld ",v[i]);
    return 0;
}