#include <fstream>
#include <vector>

using namespace std;

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

const int NumBits = 16;
const int Mask = 65535;
const int MaxN = 10000000;

int v[MaxN][2], f[Mask + 1], n, t;

static inline 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][t] >> (NumBits * step)) & Mask);
    ++f[u4];
  }
  for ( i = 1; i <= Mask; ++i ) {
    f[i] += f[i - 1];
  }
  for ( i = n - 1; i >= 0; --i ) {
	u4 = ((v[i][t] >> (NumBits * step)) & Mask);
    v[--f[u4]][1 - t] = v[i][t];	
  }
} 

static inline void radixSort() {
  for ( int i = 0; i < 2; ++i ) { 
	countSort( i );
	t = 1 - t;
  }
}

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