#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
#define NMAX 10000005
queue<int> v;
int nrc = 0;
int nrp = 1;
vector<int> ans;
void solve(queue<int> &v, int size_devide)
{
    if (v.size() == 1)
    {
        ans.push_back(v.front());
        v.pop();
        return;
    }
    if (size_devide == 0)
    {
        while (!v.empty())
        {
            ans.push_back(v.front());
            v.pop();
        }
        return;
    }
    queue<int> fr[10];
    while (!v.empty())
    {
        fr[(v.front() / size_devide) % 10].push(v.front());
        v.pop();
    }

    for (int i = 0; i < 10; i++)
    {
        if (!fr[i].empty())
        {
            solve(fr[i], size_devide / 10);
        }
    }
}
int main()
{
    int n, a, b, c;
    fin >> n >> a >> b >> c;

    v.push(b);
    int cp = c;
    while (cp > 9)
    {
        cp /= 10;
        nrc++;
        nrp *= 10;
    }

    int ant = b;
    for (int i = 1; i < n; ++i)
    {

        ant = (1ll * a * ant + b) % c;
        v.push(ant);
    }

    solve(v, nrp);
    for (int i = 0; i < n; i += 10)
    {
        fout << ans[i] << " ";
    }

    return 0;
}