#include <iostream>
#include <fstream>
#include <list>

using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int v[10000002];

bool sortUnit(int z, int n)
{
    bool sem = 1;
    int crtc;
    list<int> vList[10];

    for(int i = 1; i <= n; i++){
        crtc = (v[i]/z)%10;
        vList[crtc].push_back(v[i]);
    }
    int k = 0;
    for(int i = 0; i <= 9; i++){
        while(!vList[i].empty())
            v[++k] = vList[i].front(),
            vList[i].pop_front();
        if(i == 0 && k == n) sem = 0;
    }

    return sem;
}

int main()
{
    int n, a, b, c;
    fin >> n >> a >> b >> c;

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

    int z = 1;
    while(sortUnit(z, n)) z = z * 10;

    for(int i = 1; i <= n; i += 10)fout << v[i] << " ";

    return 0;
}