#include <iostream>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e6 + 10, mod = 998244353;

ll N, k, T, ans;
int n, m;

ll fac[MAXN], inv[MAXN], pw[MAXN];
inline ll C(int x, int y) {return (x < y ? 0 : fac[x] * inv[x - y] % mod * inv[y] % mod);}
inline ll GCD(ll x, ll y) {return !y ? x : GCD(y, x % y);}
inline ll Qpow(ll x, int y)
{
    ll res = 1;
    while (y)
    {
        if (y & 1) res = res * x % mod;
        x = x * x % mod, y >>= 1;
    }
    return res;
}

inline void Solve(int t)
{
    m = (n + 1) / t;
    if (N % m) return;
    int x = N / m; ll res = 0;
    for (int y = 0; y <= x; y++)
    {
        if (x + y > t) continue;
        if (!x) {res = (res + fac[k]) % mod; continue;}
        // cout << t << " " << m << " " << x << " " << y << "\n";
        if (k == n + 1)
        {
            if (!y && x != t) continue;
            if (!y) res = (res + fac[k]) % mod;
            else res = (res + fac[k] * Qpow(pw[m * y], mod - 2) % mod * C(x, y) % mod * C(t - x - 1, y - 1)) % mod;
        }
        else
        {
            res = (res + fac[k] * Qpow(pw[m * y], mod - 2) % mod * C(x - 1, y - 1) % mod * C(t - x - 1, y)) % mod;
            res = (res + fac[k] * Qpow(pw[m * y + m - 1], mod - 2) % mod * C(x - 1, y) % mod * C(t - x - 1, y)) % mod;
            // cout << C(x - 1, y) << " " << C(t - x - 1, y) << "\n";
        }
        // cout << res << "\n";
    }
    ans = (ans + res) % mod;
}

int main()
{
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    #if DEBUG
    #else
    // ios::sync_with_stdio(0), cin.tie(0);
    #endif
    pw[0] = fac[0] = fac[1] = inv[0] = inv[1] = 1, pw[1] = 2;
    for (int i = 2; i < MAXN; i++) pw[i] = pw[i - 1] * 2 % mod, fac[i] = fac[i - 1] * i % mod, inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    for (int i = 2; i < MAXN; i++) inv[i] = inv[i - 1] * inv[i] % mod;
    Read(N), Read(k), Read(T);
    ll sum = 0;
    while (sum + n + 1 <= N) sum += ++n;
    N -= sum;
    if (k != n && k != n + 1) return cout << "0\n", 0;
    T = GCD(n + 1, T);
    // cout << n << " " << N << " " << T << "\n";
    Solve(T);
    Write(ans, '\n');
    return 0;
}