#include <iostream>
#include <fstream>
#include <vector>

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

int n,i,j,nr,A,B,C;
vector<int> ad[300],v;

int main() {
	
	fin>>n>>A>>B>>C;
	for(i=1;i<=n;i++)
	{
		if(i==1)	nr=B;
		else	nr=(1LL*nr*A+B)%C;
		ad[nr&255].push_back(nr);
	}
	for(i=1;i<4;i++)
	{
		for(j=256;j>=0;j--)
			while(!ad[j].empty())
			{
				v.push_back(ad[j].back());
				ad[j].pop_back();
			}
		while(!v.empty())
		{
			ad[(v.back()>>(i*8))&255].push_back(v.back());
			v.pop_back();
		}
	}
	nr=10;
	for(i=0;i<=256;i++)
		for(auto j:ad[i])
		{
			nr++;
			if(nr==11)
			{
				fout<<j<<" ";
				nr=1;
			}
		}
}