#include <fstream>
#include <stack>
#define B 4
#define biti 8
#define DIM 10000010

using namespace std;

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

//2 16
//4 8


int v[DIM];
stack<int> s[1<<biti];
int n, a, b, c, i, p, k;

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


    for (p = 0; p<b; p++) {
        for (i=1;i<=n;i++)
            s[  (v[i]>>(p*biti)) & ((1<<biti)-1) ].push(v[i]);
        k = 0;
        if (p%2 == 1)
            for (i=0;i<=(1<<biti)-1;i++)
                while (!s[i].empty()) {
                    v[++k] = s[i].top();
                    s[i].pop();
                }
        else
            for (i=(1<<biti)-1;i>=0;i--)
                while (!s[i].empty()) {
                    v[++k] = s[i].top();
                    s[i].pop();
                }
    }

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

    return 0;
}