#include <iostream>
#include <queue>
#include <fstream>

using namespace std;

void cif(int &cifmax, int n)
{
    int m = 1;
    while (n > 0) {
        n/= 10;
        m *= 10;
    }
    if (cifmax < m) {
        cifmax = m;
    }
}

int main()
{
    ifstream in("radixsort.in");
    ofstream out("radixsort.out");
    queue<int> c[10], q;
    int N, A, B, C, cifmax = 1, aux;

    in >> N >> A >> B >> C;
    q.push(B);
    cif(B, cifmax);

    for (int i = 2; i <= N; i++) {
        q.push((A * q.back() + B) % C);
        cif(q.back(), cifmax);
    }

    for (int i = 1; i <= cifmax; i *= 10) {
        for (int j = 1; j <= N; j++) {
            aux = q.front();
            aux /= i;
            aux = aux % 10;
            c[aux].push(q.front());
            q.pop();
        }

        for (int j = 0; j < 10; j ++) {
            while (!c[j].empty()) {
                q.push(c[j].front());
                c[j].pop();
            }
        }
    }

    for (aux = 1; aux <= N; aux += 10) {

    }

    in.close();
    out.close();
    return 0;
}