#include <cassert>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;

#include <atcoder/modint>
#include <atcoder/convolution>
using mint = atcoder::static_modint<924844033>;

template <typename modint> struct acl_fac {
    std::vector<modint> facs, facinvs;
    acl_fac(int N) {
        assert(-1 <= N and N < modint::mod());
        facs.resize(N + 1, 1);
        for (int i = 1; i <= N; i++) facs[i] = facs[i - 1] * i;
        facinvs.assign(N + 1, facs.back().inv());
        for (int i = N; i > 0; i--) facinvs[i - 1] = facinvs[i] * i;
    }
    modint ncr(int n, int r) const {
        if (n < 0 or r < 0 or n < r) return 0;
        return facs[n] * facinvs[r] * facinvs[n - r];
    }
    modint operator[](int i) const { return facs[i]; }
    modint finv(int i) const { return facinvs[i]; }
};
acl_fac<mint> fac(300000);


int main() {
    int A, B, C;
    cin >> A >> B >> C;
    if ((A + B + C) % 2) {
        puts("0");
        return 0;
    }

    const int N = (A + B + C) / 2;
    vector<mint> dpsum(N + 1);
    auto gen = [&N](int B, int bsum) {
        vector<mint> f(N + 1);
        for (int b = 0; b <= min(N, B); b++) {
            int bs = b - (B - b);
            if ((bs % 3 + 3) % 3 != bsum) continue;
            f[b] = fac.finv(b) * fac.finv(B - b);
        }
        while (f.size() and f.back().val() == 0) f.pop_back();
        return f;
    };

    for (int bsum = 0; bsum < 3; bsum++) {
        auto h = atcoder::convolution(gen(B, bsum), gen(C, bsum));
        for (int w = 0; w < min(int(h.size()), N + 1); w++) dpsum[w] += h[w] * fac[w] * fac[B + C - w];
    }

    mint ret = 0;
    for (int n = 0; n <= N; n++) ret += dpsum[n] * fac.ncr(N, n) * fac.ncr(N, B + C - n);
    cout << ret.val() << '\n';
}