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