#include <fstream>
#define BAZA 256

using namespace std;

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

long long n,a,b,c,i,p;
int f[BAZA],w[10000001],k,nr;
unsigned long long v[10000001];

int main ()
{

    fin >> n >> a >> b >> c;
    v[1] = b;
    for (i=2; i<=n; i++)
    {
        p = a*v[i-1];
        v[i] = (p+b)%c;
    }
    nr = BAZA;
    while (nr >= k)
    {
        for (i=0; i<=BAZA-1; i++)
            f[i] = 0;
        for (i=1; i<=n; i++)
        {
            f[(v[i]/(nr/BAZA))%BAZA]++;
            if (BAZA >= v[i]/(nr/BAZA))
                k++;
        }
        for (i=1; i<=BAZA-1; i++)
            f[i] += f[i-1];
        for (i=n; i>=1; i--)
        {
            w[f[(v[i]/(nr/BAZA))%BAZA]] = v[i];
            f[(v[i]/(nr/BAZA))%BAZA]--;
        }
        for (i=1; i<=n; i++)
        {
            v[i] = w[i];
            w[i] = 0;
        }
        nr *= BAZA;
    }
    for (i=1; i<=n; i+=10)
        fout << v[i] << " ";
    return 0;
}