#include <bits/stdc++.h>

using namespace std;

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

#define int long long

const int DIM = 1e7 + 7;

vector <int> v;

int n;

void radix_sort()
{
	vector <int> t(n + 1, 0);
	vector <int> fr((1 << 8) + 2);
	
	for(int p = 0; p < 32; p += 8)
	{
		for(int i = 1; i <= n; i++)
			fr[(v[i] >> p) & ((1LL << 8) - 1)]++;
		
		for(int i = 1; i <= ((1LL << 8) - 1); i++)
			fr[i] += fr[i - 1];
		
		for(int i = n; i >= 1; i--)
		{
			t[fr[(v[i] >> p) & ((1LL << 8) - 1)]--] = v[i];
		}
		
		swap(v, t);
	}
}

main()
{
	int a, b, c;
	fin >> n >> a >> b >> c;
	
	v.resize(n + 1, 0);
	
	v[1] = b;
	
	for(int i = 2; i <= n; i++)
		v[i] = (a * v[i - 1] + b) % c;
	
	radix_sort();
	
	for(int i = 1; i <= n; i += 10)
		fout << v[i] << ' ';
}