#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
#define N 10001000
#define mask (1 << 8) -1
#define pos(x) (x >> (it * 8) ) & mask
int v[2][N];
void radix(int v[2][N],int dim)
{
    int i,it,cnt[mask + 1],index[mask + 1];
    for (it = 0; it < 4; ++it)
    {
        memset(cnt,0,sizeof(cnt));
        for (i = 0; i < dim; ++i)
            ++cnt[(v[it & 1][i] >> (it * 8)) & mask ];
        index[0] = 0;
        for (i = 1;i < mask + 1; ++i)
            index[i] = index[i - 1] + cnt[i - 1];
        for (i = 0; i < dim; ++i)
        v[( it + 1) & 1][index[pos(v[it & 1][i])]++] = v[it & 1][i];
    }
}
int main()
{
    ifstream fin ("radixsort.in");
    ofstream fout ("radixsort.out");
    int i,n = 0;
    long long a,b,c,X;
    fin >> n >> a >> b >> c;
    v[0][0] = b;
    for (i = 1; i < n; ++i)
    {
        X = (a * v[0][i-1] + b) % c;
        v[0][i] = (int)X;
    }
    radix(v,n);
    for(i = 0; i < n; i += 10)
        fout << v[0][i] << ' ';
    return 0;
}