#include <fstream>
 
using namespace std;
 
ifstream in ("radixsort.in");
ofstream out ("radixsort.out");
 
const int N = 1e7;
const int NC = 3;
const int B = 1 << 11;
 
int v[2][5 + N];
int nr[5 + B], poz[5 + B];
 
int main() {
    int n, a, b, c;
 
    in >> n >> a >> b >> c;
 
    v[1][1] = b;
    for(int i = 2; i <= n; i++)
        v[1][i] = (1LL * a * v[1][i - 1] + b) % c;
 
    for(int k = 1; k <= NC; k++) {
        for(int j = 0; j < B; j++)
            nr[j] = 0;
 
        for(int i = 1; i <= n; i++)
            nr[(v[k & 1][i] >> ((k - 1) * 11)) & (B - 1)]++;
        poz[0] = 0;
 
        for(int i = 1; i < B; i++)
            poz[i] = poz[i - 1] + nr[i - 1];
 
        for(int i = 1; i <= n; i++)
            v[(k - 1) & 1][++poz[(v[k & 1][i] >> ((k - 1) * 11)) & (B - 1)]] = v[k & 1][i];
    }
 
    for(int i = 1; i <= n; i += 10) {
        out << v[(NC - 1) & 1][i] << " ";
    }
    return 0;
}