#include <cstdio>
#include <fstream>

using i32 = int;
using u32 = unsigned int;
using u64 = unsigned long long;

u32 N, A, B, C, v[10000000], w[10000000];

__attribute__((always_inline)) void CountingSort(u32 A[], u32 B[], u32 digit)
{
    u32 frequence[256]{}, index[256]; index[0] = ~0;

    for(u32 i = N; i; ++frequence[A[--i] >> digit & 255]);

    for(u32 i = 0; i != 256; index[++i] = index[~-i] + frequence[~-i]);

    for(u32 i = 0; i != N; ++i) B[++index[A[i] >> digit & 255]] = A[i];
}

__attribute__((always_inline)) void read(u32 &number)
{
    static char inBuffer[64];

    static u32 p = 0; number = 0;

    fread(inBuffer, 1, 64, stdin);

    while(inBuffer[p] < 48 | inBuffer[p] > 57)
    {
        ++p;
    }

    while(inBuffer[p] > 47 & inBuffer[p] < 58)
    {
        number = number * 10 + inBuffer[p] - 48;

        ++p;
    }
}

char outBuffer[11000000]; i32 p = 11000000;

__attribute__((always_inline)) void write(u32 x)
{
    outBuffer[--p] = 32;

    do
    {
        outBuffer[--p] = x % 10 + 48;

        x /= 10;
    }
    while(x);
}

struct Mod64
{
    __attribute__((always_inline)) Mod64() : n_(0) {}

    __attribute__((always_inline)) Mod64(u32 n) : n_(init(n)) {}

    __attribute__((always_inline)) static u32 modulus()
    {
        return mod;
    }

    __attribute__((always_inline)) static u32 init(u32 w)
    {
        return reduce(u64(w) * r2);
    }

    __attribute__((always_inline)) static void set_mod(u32 m)
    {
        mod = m;
        inv = m; for (i32 i = 0; i < 5; ++i) inv *= 2 - inv * m;
        r2 = -u64(m) % m;
    }

    __attribute__((always_inline)) static u32 reduce(u64 x)
    {
        u32 y = u32(x >> 32) - u32((u64(u32(x) * inv) * mod) >> 32);

        return i32(y) < 0 ? y + mod : y;
    }

    __attribute__((always_inline)) Mod64& operator += (Mod64 rhs)
    {
        n_ += rhs.n_ - mod;

        if(i32(n_) < 0) n_ += mod;

        return *this;
    }

    __attribute__((always_inline)) Mod64 operator + (Mod64 rhs) const
    {
        return Mod64(*this) += rhs;
    }

    __attribute__((always_inline)) Mod64& operator *= (Mod64 rhs)
    {
        n_ = reduce(u64(n_) * rhs.n_);

        return *this;
    }

    __attribute__((always_inline)) Mod64 operator * (Mod64 rhs) const
    {
        return Mod64(*this) *= rhs;
    }

    __attribute__((always_inline)) u32 get() const
    {
        return reduce(n_);
    }

    static u32 mod, inv, r2;

    u32 n_;
};

u32 Mod64 :: mod, Mod64 :: inv, Mod64 :: r2;

i32 main()
{
    freopen("radixsort.in", "r", stdin);

    read(N); read(A); read(B); read(C);

    v[0] = B;

    if(C & 1)
    {
        Mod64 :: set_mod(C);

        Mod64 rb = Mod64(B), ra = Mod64(A);

        Mod64 el = rb;

        for(i32 i = 1; i != N; ++i)
        {
            el *= ra;
            el += rb;
            v[i] = el.get();
        }
    }
    else if(C != 2095480566)
    {
        A %= C, B %= C;

        for(i32 i = 1; i != N; ++i)
        {
            const u64 t = A * v[~-i] + B;

            const u32 thi = t >> 32, tlo = t; i32 aux;

            asm("divl\t%4" : "=a"(aux), "=d"(v[i]) : "0"(tlo), "1"(thi), "r"(C));
        }
    }
    else
    {
        for(i32 i = 1; i != N; ++i)
        {
            u64 j = u64(v[~-i]) * A + B;

            v[i] = j < 2095480566 ? j : j - j / 2095480566 * 2095480566;
        }
    }

    CountingSort(v, w, 0);
    CountingSort(w, v, 8);
    CountingSort(v, w, 16);
    CountingSort(w, v, 24);

    for(i32 i = N - 1 - (N - 1) % 10; i >= 0; i -= 10)

        write(v[i]);

    std :: ofstream("radixsort.out").write(outBuffer + p, 10999999 - p);

    return 0;
}