/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod  1999999973LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
queue<int> q[2][base];
int n,p,cnt,a,b,c,x;
int main ()
{
    f>>n>>a>>b>>c;
    q[p][b&bas].push(b);
    x=b;
    FOR(i,1,n-1)
    {
        x=1LL*a*x%c;
        x=(x+b)%c;
        q[p][x&bas].push(x);
    }
    int po=bas+1;
    FOR(i,1,3)
    {
        FOR(j,0,bas)
        {
            while(!q[p][j].empty())
            {
                int x=q[p][j].front();
                q[p][j].pop();
                q[1-p][(x/po)&bas].push(x);
            }
        }
        po<<=8;
        p=1-p;
    }
    FOR(i,0,bas)
    {
        while(!q[p][i].empty())
        {
            int x=q[p][i].front();
            q[p][i].pop();
            ++cnt;
            if((cnt-1)%10==0)
                g<<x<<" ";
        }
    }
    return 0;
}