#include <fstream>
#include <vector>

using namespace std;

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

int n, a, b, c, v[10000000];

void Sort (int bits) {
	vector < int > h[256];
	for (int i = 0; i < n; i ++)
		h[(v[i] >> bits) & 255].emplace_back (v[i]);
	for (int i = 0, n = 0; i < 256; i ++)
		for (auto it : h[i])
			v[n++] = it;
}

void Solve (int bits) {
	vector < int > h[256];
	for (int i = 0; i < n; i ++)
		h[(v[i] >> bits) & 255].emplace_back (v[i]);
	for (int i = 0, n = 9; i < 256; i ++)
		for (auto it : h[i]) {
      n ++;
      if (n == 10) {
        fout << it << ' ';
        n = 0;
      }
		}
}

int main () {
	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;
	Sort(0), Sort(8), Sort(16), Solve(24);
	return 0;
}