#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) {}
    bool unionSet(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
        if (data[y] < data[x]) swap(x, y);
        data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

const int N = 100000;

class Eratosthenes{
    public:
    int m;
    vector<bool> is_prime;
    vector<int> primes;
    Eratosthenes(int m_){
        m = m_;
        init();
    }
    private:
    void init(){
        is_prime.assign(m+1, true);
        is_prime[0] = false, is_prime[1] = false;
        for(int i = 2; i <= m; i++){
            if(is_prime[i]){
                primes.push_back(i);
                for(int j = 2; i*j <= m; j++) is_prime[i*j] = false;
            }
        }
    }
};

Eratosthenes et(N);

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, p, q; cin >> n >> p >> q;
    if(p == 1 && q == 1){
        cout << 1 << endl;
        return 0;
    }else if(p == 1 || q == 1){
        cout << 2 << endl;
        return 0;
    }else if(p+q <= n){
        cout << 4 << endl;
        return 0;
    }else if(p == n && q == n){
        cout << 2 << endl;
        return 0;
    }
    vector<int> perm(n);
    iota(perm.begin(), perm.end(), 0);
    for(int i = 0; i < p; i++){
        int j = p-1-i;
        if(i < j) swap(perm[i], perm[j]);
    }
    for(int i = n-1; i >= n-q; i--){
        int j = (2*n-q-1)-i;
        if(i < j) swap(perm[i], perm[j]);
    }
    UnionFind uf(n);
    for(int i = 0; i < n; i++) uf.unionSet(i, perm[i]);
    vector<int> mx(N+1);
    for(int i = 0; i < n; i++){
        if(uf.root(i) != i) continue;
        int cur = uf.size(i);
        for(int p: et.primes){
            if(p > cur) break;
            int cnt = 0;
            while(cur%p == 0){
                cur /= p;
                cnt++;
            }
            chmax(mx[p], cnt);
        }
    }
    mint ans = 1;
    for(int p: et.primes){
        for(int i = 0; i < mx[p]; i++) ans *= p;
    }
    ans *= 2;
    cout << ans << endl;
}