#include <bits/stdc++.h>

#include <atcoder/modint>

using namespace std;
using namespace atcoder;

using mint = modint998244353;

vector<mint> fact, inv;

void init(int n) {
    fact.push_back(1);
    inv.push_back(1);
    for (int i = 0; i < n; i++) {
        fact.push_back(fact.at(i) * (i + 1));
        inv.push_back(fact.at(i + 1).inv());
    }
}

mint ncr(int n, int r) {
    if (r < 0 or n < r) {
        return 0;
    }
    return fact.at(n) * inv.at(r) * inv.at(n - r);
}

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    if (m + k > n) {
        int d = m + k - n;
        n -= d;
        m -= d;
        k -= d;
    }
    init(n);
    mint ans = 0;
    for (int i = 0; i <= n; i++) {
        ans += ncr(m, i) * ncr(k, i) * fact.at(i);
    }
    ans *= fact.at(n) * inv.at(m + k);
    cout << ans.val() << endl;
    return 0;
}