#include <bits/stdc++.h>

using namespace std;

class InParser {
	
private:
	
	FILE *fin;
	
	char *buff;
	
	int sp;
	
 
	
	char read_ch() {
	
		++sp;
	
		if (sp == 4096) {
	
			sp = 0;
	
			fread(buff, 1, 4096, fin);
	
		}
	
		return buff[sp];
	
	}
	
 
	
public:
	
	InParser(const char* nume) {
	
		fin = fopen(nume, "r");
	
		buff = new char[4096]();
	
		sp = 4095;
	
	}
	
	
	
	InParser& operator >> (int &n) {
	
		char c;
	
		while (!isdigit(c = read_ch()) && c != '-');
	
		int sgn = 1;
	
		if (c == '-') {
	
			n = 0;
	
			sgn = -1;
	
		} else {
	
			n = c - '0';
	
		}
	
		while (isdigit(c = read_ch())) {
	
			n = 10 * n + c - '0';
	
		}
	
		n *= sgn;
	
		return *this;
	
	}
	
	
	
	InParser& operator >> (long long &n) {
	
		char c;
	
		n = 0;
	
		while (!isdigit(c = read_ch()) && c != '-');
	
		long long sgn = 1;
	
		if (c == '-') {
	
			n = 0;
	
			sgn = -1;
	
		} else {
	
			n = c - '0';
	
		}
	
		while (isdigit(c = read_ch())) {
	
			n = 10 * n + c - '0';
	
		}
	
		n *= sgn;
	
		return *this;
	
	}
	
};

ofstream fout("radixsort.out");

const int DIM = 1e7 + 7;
const int mask = (1 << 8) - 1;

int n;

int v[DIM];
int t[DIM];

int fr[mask + 7];

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

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