#include <iostream>
#include <fstream>
#include <queue>
#define CNT 1000
using namespace std;

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

int n,a,b,c;
int v[10000003];
int mx;
queue<int> ct[CNT];
queue<int> emp;

void radixsort(int exp) {

    for(int i = 0; i < n; i++)
        ct[(v[i]/exp)%CNT].push(v[i]);
    int cnt = 0;
    for(int i = 0; i < CNT; i++) {

        while(!ct[i].empty()) {

            v[cnt++] = ct[i].front();
            ct[i].pop();

        }

    }

}

int main() {

    in >> n >> a >> b >> c;

    v[0] = b;
    for(int i = 1; i < n; i++) {
        v[i] = (1LL*a*v[i-1]+b)%c;
        if(v[i] > mx)
            mx = v[i];
    }

    for(int exp = 1; mx/exp > 0; exp *= CNT)
        radixsort(exp);

    for(int i = 0; i < n; i += 10)
        out << v[i] << " ";

    return 0;
}