#include <bits/stdc++.h>
#define MAX 10000000
#define NR_BUCKETS 2
#define SIZE_BUCKET 256

using namespace std;

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

int v[MAX + 5], temp[MAX + 5], vf[MAX + 5], sp[MAX + 5];
int n, a, b, c;

void radix(int *A, int *B, int bit)
{
    int aux, nrBits;

    if(bit == 1)
    {
        aux = 0x000000ff;
        nrBits = 0;
    }
    else if(bit == 2)
    {
        aux = 0x0000ff00;
        nrBits = 8;
    }
    else if(bit == 3)
    {
        aux = 0x00ff0000;
        nrBits = 16;
    }
    else
    {
        aux = 0xff000000;
        nrBits = 24;
    }

    memset(vf, 0, sizeof(vf));

    for(int i = 0; i < n; i++)
        vf[(A[i] & aux) >> nrBits]++;

    sp[0] = 0;
    for(int i = 1; i < SIZE_BUCKET; i++)
        sp[i] = sp[i - 1] + vf[i - 1];

    for(int i = 0; i < n; i++)
        B[sp[(A[i] & aux) >> nrBits]++] = A[i];
}

void solve()
{
    v[0] = b % c;

    for(int i = 1; i < n; i++)
        v[i] = (1LL * a * v[i - 1] % c + b) % c;

    for(int i = 0; i < 4; i++)
    {
        if(i % 2 == 0)radix(v, temp, i);
        else radix(temp, v, i);
    }

    for(int i = 0; i < n; i += 10)
        fout << v[i] << " ";
}

int main()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
    fout.tie(0);
    srand(time(NULL));

    fin >> n >> a >> b >> c;

    solve();

    fin.close();
    fout.close();

    return 0;
}