#include <fstream>
#include <vector>
#define Nmax 10000002
#define LL long long
using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");

int n,a,b,c,v[Nmax],nr;

void _sort(int mask,int k)
{
    vector<int> BUK[301];
    for (int i=0;i<=260;i++)
        BUK[i].clear();
    for (int i=1;i<=n;i++)
        BUK[(v[i]&mask)>>(8*k)].push_back(v[i]);
    nr = 1;
    for (int i=0;i<=260;i++)
        for (int j=0;j<BUK[i].size();j++)
            v[nr++] = BUK[i][j];
}

int main()
{
    f>>n>>a>>b>>c;
    v[1] = b;
    for (int i=2;i<=n;i++)
        v[i] = ((LL)a*v[i-1] + b)%c;


    int mask = (1<<8)-1;

    for (int i=1;i<=4;i++)
    {
        _sort(mask,i-1);
        if (i<3)
            mask<<=8;
        else if (i==3)
            mask<<=7;
    }
    for (int i=1;i<=n;i+=10)
        g<<v[i]<<' ';

    return 0;
}