#include <bits/stdc++.h>
using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

const int Nmax = 1e7 + 5;
int v[Nmax], a, b, c, n;
 
void RadixSort(int v[], int n)
{
  int aux[Nmax+1];
  int frecv[256];
  for(int p = 0; p < 32; p += 8)
  {
      for(int i = 0; i < 256; i++)
          frecv[i] = 0;

      for(int i = 1; i <= n; i++)
          frecv[(v[i] >> p) & 255]++;

      for(int i = 1; i < 256; i++)
          frecv[i] += frecv[i - 1];

      for(int i = n; i >= 1; i--)
          aux[frecv[(v[i] >> p) & 255]--] = v[i];

      for(int i = 1; i <= n; i++)
          v[i] = aux[i];
  }
  
}
 
int main() 
{
    fin>>n>>a>>b>>c;
    v[1]=b;
    for(int i=2; i<=n; i++)
        v[i] = (1LL * a * v[i-1] + b) % c;
 
    RadixSort(v, n);

    for(int i=1; i<=n; i+=10)
        fout << v[i] << ' ';
 
    return 0;
}