#include <bits/stdc++.h>

using namespace std;

int v[10000005];

int main()
{
    int i,n,A,B,C;
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);
    scanf("%d %d %d %d",&n,&A,&B,&C);
    v[1] = B%C;
    for(i = 2;i <= n;i++){
        v[i] = (1LL*A*v[i-1]+B)%C;
    }
    sort(v+1, v+n+1);
    for(i = 1;i <= n;i += 10){
        printf("%d ",v[i]);
    }
    return 0;
}