#include <cstdio>

unsigned int N, A, B, C, v[0x989680], w[0x989680], p;

__attribute__((always_inline)) void CountingSort(unsigned int A[], unsigned int B[], unsigned int digit)
{
    unsigned int frequence[0x100]{}, index[0x100]; index[0x0] = ~0x0;

    for(unsigned int i = N; i; ++frequence[A[--i] >> digit & 0xFF]);

    for(unsigned int i = 0x0; i != 0x100; index[++i] = index[~-i] + frequence[~-i]);

    for(unsigned int i = 0x0; i != N; ++i) B[++index[A[i] >> digit & 0xFF]] = A[i];
}

__attribute__((always_inline)) void read(unsigned int &num)
{
    static char inBuffer[0x40];

    static unsigned int p = 0x0; num = 0x0;

    fread(inBuffer, 0x1, 0x40, stdin);

    while(inBuffer[p] < 0x30 | inBuffer[p] > 0x39)
    {
        ++p;
    }

    while(inBuffer[p] > 0x2F & inBuffer[p] < 0x3A)
    {
        num = num * 0xA + inBuffer[p] - 0x30;

        ++p;
    }
}

char outBuffer[0xA7D8C0];

__attribute__((always_inline)) void itoa(unsigned int x)
{
    unsigned int digits = x > 0x3B9AC9FF ? 0xA :
                          x > 0x5F5E0FF  ? 0x9 :
                          x > 0x98967F   ? 0x8 :
                          x > 0xF423F    ? 0x7 :
                          x > 0x1869F    ? 0x6 :
                          x > 0x270F     ? 0x5 :
                          x > 0x3E7      ? 0x4 :
                          x > 0x63       ? 0x3 :
                          x > 0x9        ? 0x2 : 0x1;

    for(unsigned int i = ~-digits; ~i; --i)
    {
        outBuffer[p + i] = x % 0xA + 0x30;

        x = x / 0xA;
    }

    p = p + digits; outBuffer[p++] = 0x20;
}

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

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

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

    static u32 modulus() { return mod; }

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

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

    static u32 reduce(u64 x)
    {
        u32 y = u32(x >> 32) - u32((u64(u32(x) * inv) * mod) >> 32);
        return i32(y) < 0 ? y + mod : y;
    }

    Mod64& operator += (Mod64 rhs) { n_ += rhs.n_ - mod; if (i32(n_) < 0) n_ += mod; return *this; }

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

    Mod64& operator *= (Mod64 rhs) { n_ = reduce(u64(n_) * rhs.n_); return *this; }

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

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

    static u32 mod, inv, r2;

    u32 n_;
};

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

int main()
{
    freopen("radixsort.in", "r", stdin);
    freopen("radixsort.out", "w", stdout);

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

    v[0x0] = B;

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

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

        Mod64 el = rb;

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

        for(int i = 1; i != N; ++i)
        {
            const unsigned long long t = A * v[i - 1] + B;

            const unsigned int thi = t >> 32, tlo = t; int aux;

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

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

    CountingSort(v, w, 0x0);
    CountingSort(w, v, 0x8);
    CountingSort(v, w, 0x10);
    CountingSort(w, v, 0x18);

    for(unsigned int i = 0x0; i != N; i = i + 0xA)
    {
        itoa(v[i]);
    }

    fwrite(outBuffer, 0x1, p, stdout);

    return 0x0;
}