#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 500005;

int add(int a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0) a += mod;
    return a;
}

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

int Pow(int a, int b) {
    int ans = 1;
    for (; b; b >>= 1, a = mul(a, a)) {
        if (b & 1) ans = mul(ans, a);
    }
    return ans;
}

int fac[N], ifac[N], inv[N];

int C(int n, int m) {
    if (n < 0 || m < 0 || n < m) return 0;
    return mul(fac[n], mul(ifac[m], ifac[n - m]));
}

int calc(int l, int r, int m) {
    
    // x in [l, r], sum of C(x, m)
    l = max(l, m);
    if (l > r) return 0;
    return sub(C(r + 1, m + 1), C(l, m + 1));
    int ans = 0;
    for (int i = l; i <= r; ++i) ans = add(ans, C(i, m));
    return ans;
}

int calc2(int l, int r, int m) {
    // x in [l, r], sum of x * C(x, m)
    return sub(mul(add(m,1),calc(l+1,r+1,m+1)),calc(l,r,m));
    int ans = 0;
    for (int i = l; i <= r; ++i) ans = add(ans, mul(i, C(i, m)));
    return ans;
}

int ifloor(int a, int b) {
    if (a < 0 && a % b) return a / b - 1;
    return a / b;
}

int solve(int n, int m, int s) {
    int ans = 0;
    for (int l = 1; l <= n; ++l) {
        // t <= l + 1
        // t = s + 2d + (m & 1)
        // cout << "# " << n << ' ' << s << ' ' << (m & 1) << endl;
        int lo = max(2 * l + s - m, 1), hi = min(s + l, n);
        int cl = ifloor(lo - s - (m & 1), 2), cm = ifloor(min(l + 1, hi) - s - (m & 1), 2), cr = ifloor(hi - s - (m & 1), 2);
        cl = max(cl, 0);
        // cout << l << ' ' << cl << ' ' << cm << ' ' << cr << endl;
        int off = (m + 1) / 2 - 1;
        if (cl <= cm) {
            int val = min(s + l, n) - (l + 1) + 1;
            //cout << off << ' ' << val << endl;
            ans = add(ans, mul(val, calc(off + cl, off + cm, l - 1)));
        }

        // cout << "$ " << l << " " << ans << endl;

        cm = max(cm, cl-1);
        // t > l + 1
        if (cm + 1 <= cr) {
            int val = min(s + l, n) - (s + (m & 1)) + 1;
            // cout << val << endl;
            ans = add(ans, mul(val, calc(off + cm + 1, off + cr, l - 1)));
            // cout << "!!" << off + cm + 1 << ' ' << off + cr << ' ' << l - 1 << endl;
            // cout << "$" << ans << endl;
            int res = calc2(off + cm + 1, off + cr, l - 1);
            res = sub(res, mul(calc(off + cm + 1, off + cr, l - 1), off));
            // cout << "$" << res << endl;
            // cout << "$# " << off << endl;
            ans = sub(ans, mul(2, res));
        }
        // cout << l << ' ' << ans << endl;
    }
    return ans;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    inv[1] = fac[1] = ifac[1] = fac[0] = ifac[0] = 1;
    for (int i = 2; i < N; ++i) {
        inv[i] = sub(0, mul(inv[mod % i], mod / i));
        fac[i] = mul(fac[i - 1], i);
        ifac[i] = mul(ifac[i - 1], inv[i]);
    }
    int n, m, s;
    cin >> n >> m >> s, --m;

    if (m == 0) {
        cout << "1\n";
        return 0;
    }

    int ans = add(solve(n, m, s), solve(n, m, n + 1 - s));
    for (int t = s; t <= s; ++t) {
        if ((s - t - m) & 1) {
            continue;
        }
        for (int l = abs(s - t); l <= (m + abs(s - t)) / 2 && l <= n; ++l) {
            int a = min(min(s, t) + l, n) - max(max(s, t), l + 1) + 1;
            int b = C((m + abs(s - t)) / 2 - 1, l - 1);
            ans = sub(ans, mul(a, b));
        }
    }
    cout << ans << '\n';
}