#include <cstdio>
        #include <algorithm>
        using namespace std;
        long long int a[10000001];
        int main()
        {
            long long int n, x, y, z, i;
            freopen("radixsort.in","r",stdin);
            freopen("radixsort.out","w",stdout);
            scanf("%lld%lld%lld%lld",&n,&x,&y,&z); a[1]=y;
            for (i=2; i<=n; i++) a[i]=(x*a[i-1]+y)%z;
            sort(a+1,a+n+1);
            for (i=1; i<=n; i+=10) printf("%lld ",a[i]);
            fclose(stdin);
            fclose(stdout);
            return 0;
        }