#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll unsigned long long
#define bit 20
#define inf 500000000
#define base 256
#define ba 255
#define mod  1999999973
#define inu "radixsort.in"
#define outu "radixsort.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
queue<int> q[2][base];
int a,b,c,d,n,p,j,x,y;
int main ()
{
	f>>n>>a>>b>>c;
	d=b;
	q[p][b&ba].push(b);
	FOR(i,2,n)
	{
		b=(1LL*b*a+d)%c;
		q[p][b&ba].push(b);
	}
	for(int i=1;i<4;p=1-p,i++)
		for(j=0;j<base;++j)
			for(;!q[p][j].empty();q[p][j].pop())
			{
				x=q[p][j].front();
				y=x>>(8*i);
				q[1-p][y&ba].push(x);
			}
	j=1;
	for(int i=0;i<base;++i)
		for(;!q[p][i].empty();q[p][i].pop(),++j)
			if((j-1)%10==0)
				g<<q[p][i].front()<<" ";
	return 0;
}