#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "radixsort.in";
const char outfile[] = "radixsort.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int bits = 8;
const int mask = (1 << bits) - 1;
const int maxBucket = (1 << bits);
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

inline void radixSort(vector <int> &v) {
    int N = v.size();
    vector <int> actV(N);
    for(int step = 0 ; step < 4 ; ++ step) {
        vector <int> _count(maxBucket);
        int shift = step * bits;
        for(int i = 0 ; i < N ; ++ i)
            ++ _count[(v[i] >> shift) & mask];
        for(int i = 1 ; i < maxBucket ; ++ i)
            _count[i] += _count[i - 1];
        for(int i = N - 1 ; i >= 0 ; -- i)
            actV[ -- _count[(v[i] >> shift) & mask] ] = v[i];
        for(int i = 0 ; i < N ; ++ i)
            v[i] = actV[i];
    }
}

int main() {
    int N, A, B, C;
    vector <int> v;

    fin >> N >> A >> B >> C;
    v.push_back(B);
    for(int i = 1 ; i < N ; ++ i) {
        int aux = ((1LL * A * v[i - 1]) % C + 1LL * B) % C;
        v.push_back(aux);
    }

    radixSort(v);

    for(int i = 0 ; i < N ; i += 10)
        fout << v[i] << ' ';

    fin.close();
    fout.close();
    return 0;
}