#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MOD = 998244353;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
    int res = 1;
    while (n) {
        if (n % 2 == 0) {
            x = mul(x, x);
            n /= 2;
        } else {
            res = mul(res, x);
            --n;
        }
    }
    return res;
}

const int MAXF = 2e6;
int fact[MAXF], invf[MAXF];

int C(int n, int k) {
    return mul(fact[n], mul(invf[k], invf[n - k]));
}

int get(int a, int b, int c) {
    return mul(C(b - 1, c - 1), C(a, c));
}

int mu[MAXF], mn[MAXF];

vector<int> divis[MAXF];
vector<int> ans[MAXF];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    fact[0] = 1;
    for (int i = 1; i < MAXF; ++i) {
        fact[i] = mul(fact[i - 1], i);
    }
    invf[MAXF - 1] = pw(fact[MAXF - 1], MOD - 2);
    for (int i = MAXF - 1; i > 0; --i) {
        invf[i - 1] = mul(invf[i], i);
    }

    /**int mx = 0;
    for (int x = 1; x <= 2'000'000; ++x) {
        int sum = 0;
        for (int t = 1; t * t <= x; ++t) {
            if (x % t == 0) {
                sum += x;
                if (t * t != x) {
                    sum += t / x;
                }
            }
        }
        if (sum > mx) {
            mx = sum;
            cout << x << " " << sum << endl;
        }
    }*/

    vector<int> prm;
    mu[1] = 1;
    for (int i = 2; i < MAXF; ++i) {
        if (mn[i] == 0) {
            mn[i] = i;
            mu[i] = MOD - 1;
            prm.push_back(i);
        }
        for (int p : prm) {
            if (p > mn[i] || p * i >= MAXF) break;
            mn[p * i] = p;
            if (p == mn[i]) {
                mu[p * i] = 0;
            } else {
                mu[p * i] = mul(mu[p], mu[i]);
            }
        }
    }

    int64_t n, k, t;
    cin >> n >> k >> t;

    int x = 0;
    while (1ll * x * (x + 1) / 2 < n) ++x;

    if (k != x && k != x - 1) {
        cout << "0\n";
        return 0;
    }
    int cnt1 = 1ll * x * (x + 1) / 2 - n;

    /**int check = 0;
    for (int mask = 0; mask < (1 << x); ++mask) {
        int sum = 0;
        vector<int> arr(x);
        for (int i = 0; i < x; ++i) {
            if (mask & (1 << i)) {
                arr[i] = 1;
                ++sum;
            }
        }
        if (sum != cnt1) continue;
        if (k == x - 1 && arr[0] == 0) continue;
        if (k == x && arr[0] == 1) continue;
        bool f = true;
        for (int i = 0; i < x; ++i) {
            if (arr[(i + t) % x] != arr[i]) {
                f = false;
            }
        }
        if (!f) continue;
        int cnt01 = 0;
        for (int i = 1; i < x; ++i) {
            if (arr[i - 1] == 0 && arr[i] == 1) ++cnt01;
        }
        int cur = fact[k];
        for (int i = 0; i < cnt01; ++i) {
            cur = mul(cur, (MOD + 1) / 2);
        }
        check = add(check, cur);
    }
    cerr << check << endl;*/

    bool adeq = true;

    if (k == x - 1) {
        adeq = false;
        if (n == 1ll * x * (x + 1) / 2) {
            cout << "0\n";
            return 0;
        }
        cnt1 = x - cnt1;
    }

    if (n == 1ll * x * (x + 1) / 2) {
        cout << fact[x] << "\n";
        return 0;
    }

    t = __gcd(t, (int64_t)x);

    /**for (int i = 1; i <= t; ++i) {
        if (t % i != 0) continue;
        for (int j = 2 * i; j <= t; j += i) {
            divis[j].push_back(i);
        }
    }*/
    vector<int> pw2(x + 1);
    pw2[0] = 1;
    for (int i = 1; i <= x; ++i) {
        pw2[i] = mul(pw2[i - 1], (MOD + 1) / 2);
    }

    int total = 0;

    if (adeq) {
        /// int64_t sum = 0;
        for (int d = 1; d <= t; ++d) {
            if (t % d != 0) continue;
            if (cnt1 % (x / d) != 0) continue;
            /// sum += d;
            /// /// cerr << "d: " << d << endl;
            vector<int> ans(d + 1);
            int c1 = cnt1 / (x / d);
            int c0 = d - c1;
            for (int i = 1; i <= d; ++i) {
                if (i <= c0 && i <= c1) {
                    ans[i] = get(c0, c1, i);
                }
            }
            /// /// /// cerr << ans[d][0] << " " << ans[d][1] << " " << ans[d][2] << endl; 
            /// /// cerr << "init done" << endl;
            /**for (int d1 : divis[d]) {
                if (cnt1 % (x / d1) != 0) continue;
                for (int i = 0; i <= d1; ++i) {
                    ans[d][i * (d / d1)] = sub(ans[d][i * (d / d1)], ans[d1][i]);
                }
            }*/
            int cnt = 0;
            for (int d1 = d; d1 <= t; d1 += d) {
                if (t % d1 != 0) continue;
                if (cnt1 % (x / d1) != 0) continue;
                cnt = add(cnt, mu[d1 / d]);
            }
            for (int i = 0; i <= d; ++i) {
                total = add(total, mul(cnt, mul(ans[i], pw2[i * (x / d)])));
            }
            /// cerr << "d: " << d << endl;
            /// cerr << "total: " << mul(total, fact[x]) << endl;
        }
        /// cerr << sum << endl;
        cout << mul(total, fact[x]) << "\n";
    } else {
        for (int d = 1; d <= t; ++d) {
            if (t % d != 0) continue;
            if (cnt1 % (x / d) != 0) continue;
            vector<int> ans(d + 1);
            int c1 = cnt1 / (x / d);
            int c0 = d - c1;
            for (int i = 1; i <= d; ++i) {
                if (i <= c0 && i <= c1) {
                    ans[i] = mul(C(c0 - 1, i - 1), C(c1 - 1, i - 1));
                }
            }
            /**for (int d1 : divis[d]) {
                if (cnt1 % (x / d1) != 0) continue;
                for (int i = 0; i <= d1; ++i) {
                    ans[d][i * (d / d1)] = sub(ans[d][i * (d / d1)], ans[d1][i]);
                }
            }*/
            int cnt = 0;
            for (int d1 = d; d1 <= t; d1 += d) {
                if (t % d1 != 0) continue;
                if (cnt1 % (x / d1) != 0) continue;
                cnt = add(cnt, mu[d1 / d]);
            }
            for (int i = 1; i <= d; ++i) {
                total = add(total, mul(cnt, mul(ans[i], pw2[i * (x / d) - 1])));
            }
            /// cerr << "d: " << d << endl;
            /// cerr << "total: " << mul(total, fact[x]) << endl;
        }
        for (int d = 1; d <= t; ++d) {
            if (t % d != 0) continue;
            if (cnt1 % (x / d) != 0) continue;
            int c1 = cnt1 / (x / d);
            int c0 = d - c1;
            vector<int> ans(d + 1);
            for (int i = 1; i <= d; ++i) {
                if (i < c0 && i <= c1) {
                    ans[i] = mul(C(c0 - 1, i), C(c1 - 1, i - 1));
                }
            }
            /// /// /// cerr << ans[d][0] << " " << ans[d][1] << " " << ans[d][2] << endl; 
            /// /// cerr << "init done" << endl;
            /**for (int d1 : divis[d]) {
                if (cnt1 % (x / d1) != 0) continue;
                for (int i = 0; i <= d1; ++i) {
                    ans[d][i * (d / d1)] = sub(ans[d][i * (d / d1)], ans[d1][i]);
                }
            }*/
            int cnt = 0;
            for (int d1 = d; d1 <= t; d1 += d) {
                if (t % d1 != 0) continue;
                if (cnt1 % (x / d1) != 0) continue;
                cnt = add(cnt, mu[d1 / d]);
            }
            for (int i = 0; i <= d; ++i) {
                total = add(total, mul(cnt, mul(ans[i], pw2[i * (x / d)])));
            }
            /// cerr << "d: " << d << endl;
            /// cerr << "total: " << mul(total, fact[x]) << endl;
        }
        cout << mul(total, fact[k]) << "\n";
    }

    return 0;
}