#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int v[10000000];
int main()
{  int n,a,b,c;
    FILE *f=fopen("radixsort.in","r");
    FILE *g=fopen("radixsort.out","w");
  fscanf(f,"%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;

  for(int i=2;i<=n;i++)
  {
    v[i] = (a*v[i-1] + b) % c;

  }

sort(v+1,v+n+1);
  for(int i=1;i<=n;i=i+10)
  {

   fprintf(g,"%d ",v[i]);
  }
    return 0;
}