#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
// 素因数分解
vector<P> PrimeFactorization(long long n) {
	vector<P> ret;
	for (long long i = 2; i*i <= n; i++) {
		int c = 0;
		while (n%i == 0) { // 素数で割り切れなくなるまで割っていく
			c++;//割った個数を配列に足す
			n /= i;
		}
		if (0 != c) ret.push_back({ i,c });
		if (1 == n) break;
	}
	if (1 != n) ret.push_back({ n,1 });
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, p, q; cin >> n >> p >> q;
	if ((1 == p) && (1 == q)) {
		cout << 1 << endl;
		return 0;
	}
	if ((1 == p) || (1 == q)) {
		cout << 2 << endl;
		return 0;
	}
	vector<int>a(n);
	rep(i, n)a[i] = i;
	reverse(a.begin() + 0, a.begin() + p);
	reverse(a.begin() + n - q, a.begin() + n);
	dsu uf(n);
	rep(i, n)uf.merge(i, a[i]);
	map<int, int>mp;
	rep(i, n) {
		if (i == uf.leader(i)) {
			int x = uf.size(i);
			auto vec = PrimeFactorization(x);
			for (auto[k, v] : vec) chmax(mp[k], v);
		}
	}
	mint ans = 2;
	for (auto[k, v] : mp)ans *= pow_mod(k, v, mod);
	cout << ans.val() << endl;
	return 0;
}