#include<cstdio>
#include<vector>
#define MAX_BUCKETS 10
#define BASE 10
using namespace std;
 
vector<int>v;
int n, a, b, c, maxim;

struct aici
{
	vector<int>g[MAX_BUCKETS];
};

aici vs[10];
int iCount = 0;
 
void readArray() {
    FILE* fin = fopen("radixsort.in", "r");
    fscanf(fin,"%d%d%d%d",&n, &a, &b, &c);
    v.push_back(b);
    maxim = b;
    for(int i = 1; i < n; i++) {
        v.push_back((1LL * a * v[v.size() - 1] + b) % c);
        if(v[v.size() - 1] > maxim)
            maxim = v[v.size() - 1];
    }
    fclose(fin);
}
 
void radixSort() {
    vector<int>::iterator it;
    int i, exp, m;
    for(exp = 1; maxim / exp > 0; exp *= 10) {
        for(it = v.begin(); it != v.end(); ++it)
            vs[iCount].g[((*it) / exp) % BASE].push_back((*it));
        m = 0;
        for(i = 0; i < BASE; ++i) {
            for(it = vs[iCount].g[i].begin(); it != vs[iCount].g[i].end(); ++it)
                v[m++] = (*it);
        }
    }
	++iCount;
}
 
void writeArray() {
    FILE* fout = fopen("radixsort.out", "w");
    for(int i = 0; i < v.size(); i += 10)
        fprintf(fout,"%d ",v[i]);
    fprintf(fout,"\n");
    fclose(fout);
}
 
int main() {
    readArray();
    radixSort();
    writeArray();
    return 0;
}