#include <fstream>
#include <vector>

using namespace std;

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

const int NumBits = 8;
const int Mask = 127;
const int MaxN = 10000000;

int v[MaxN], f[MaxN], aux[MaxN], n;
//vector<int> nr[Mask + 1];

void countSort( int step ) {
  int u4, i, j, k;
   
  for ( i = 0; i <= Mask; ++i ) {
	f[i] = 0;
  }
  for ( i = 0; i < n; ++i ) {
	u4 = ((v[i] >> (NumBits * step)) & Mask);
    ++f[u4];
  }
  /*
  k = 0;
  for ( i = 0; i <= Mask; ++i ) {
	for ( j = 0; j < nr[i].size(); ++j ) {
      v[k++] = nr[i][j];
	}
	nr[i].clear();
  }
  */
  for ( i = 1; i <= Mask; ++i ) {
    f[i] += f[i - 1];
  }
  for ( i = n - 1; i >= 0; --i ) {
	u4 = ((v[i] >> (NumBits * step)) & Mask);
    aux[--f[u4]] = v[i];	
  }
  for ( i = 0; i < n; ++i ) {
	v[i] = aux[i];	
	aux[i] = 0;
  }
} 

void radixSort() {
  for ( int i = 0; i < 4; ++i ) { 
	countSort( i );
  }
}

int main() {
  int a, b, c;
  
  fin >> n >> a >> b >> c;
  v[0] = b;
  for ( int i = 1; i < n; ++i ) {
    v[i] = ((long long)a * v[i - 1] + b) % c;
  }
  /*
  for ( int i = 0; i <= Mask; ++i ) {
	nr[i].reserve( MaxN + 1 );
  }
  */
  radixSort();
  for ( int i = 0; i < n; i += 10 ) {
    fout << v[i] << " ";	
  }
  fin.close();
  fout.close();
  return 0;
}