#include<cstdio>
#include<algorithm>
using namespace std;
int n,v[10000009];
void Read()
{
    int A,B,C;
    scanf("%d",&n);
    scanf("%d",&A);
    scanf("%d",&B);
    scanf("%d",&C);
    v[1]=B;
    for(int i=2;i<=n;i++)
        v[i]=(1LL*v[i-1]*A+B)%C;
}
void Print()
{
    for(int i=1;i<=n;i+=10)
        printf("%d ",v[i]);
    printf("\n");
}
int main()
{
freopen("radixsort.in","r",stdin);
freopen("radixsort.out","w",stdout);
Read();
sort(v+1,v+n+1);
Print();
return 0;
}