#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 10000005;

int n;

int v[NMAX];
deque <int> q[257];

void radixsort()
{
    int comp=(1<<8)-1; /// 11111111;
    for(int b=0;b<=32-1;b+=8)
    {
        int cif;
        for(int i=1;i<=n;i++)
        {
            cif=(v[i]>>b)&comp;
            q[cif].push_back(v[i]);
        }
        int k=0;
        for(int i=0;i<=comp;i++)
        {
            while(!q[i].empty())
            {
                v[++k]=q[i].front();
                q[i].pop_front();
            }
        }
    }
}

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