#include<cstdio>
#include<algorithm>
#define Ser 10000005
#define py (1<<8)-1
using namespace std;
int  n,a,b,c;
long long i,in[py],bi[Ser],v[Ser],mx;
void radixsort(long long  a[Ser], int n)
{
  long long  lv = 256;

int j;

  for(j=0;j<=4;j++)
  {

    for (i = 0; i < n; i++)
      in[(a[i]/lv)%256]++;
    for (i = 1; i < 256; i++)
     in[i] += in[i - 1];
    for (i = n - 1; i >= 0; i--)
      bi[--in[(a[i] / lv) % 256]] = a[i];
    for (i = 0; i < n; i++)
      a[i] = bi[i];
    lv *= 256;

  }
}

int main()

{ freopen ("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);

  scanf("%d%d%d%d", &n,&a,&b,&c);
  v[0]=b;
  mx= v[0];
   for (i =1; i < n; i++){
  v[i] = ((long long)a * v[i-1]+b) %c;
  if(mx<v[i])mx=v[i];}
sort(v, v+n);



  radixsort(v, n);


  for (i = 0; i < n; i+=10)
    printf("%lld ", v[i]);


  return 0;
}