// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; #define int ll using pii = pair; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i, n) for (int i = (int)(n); i >= 1; i--) #define loop(i, a, B) for (int i = a; i B; i++) #define loopR(i, a, B) for (int i = a; i B; i--) #define all(x) begin(x), end(x) #define allR(x) rbegin(x), rend(x) #define pb push_back #define eb emplace_back #define fst first #define snd second template auto constexpr inf_ = numeric_limits::max()/2-1; auto constexpr INF32 = inf_; auto constexpr INF64 = inf_; auto constexpr INF = inf_; #ifdef LOCAL #include "debug.hpp" #define oj_local(x, y) (y) #else #define dump(...) (void)(0) #define debug if (0) #define oj_local(x, y) (x) #endif template struct pque : priority_queue, Comp> { vector &data() { return this->c; } void clear() { this->c.clear(); } }; template using pque_max = pque>; template using pque_min = pque>; template ::value, int> = 0> ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ::value, int> = 0> ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; } template ())), class = typename enable_if::value>::type> istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; } template ostream& operator<<(ostream& os, pair const& p) { return os << p.first << " " << p.second; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } template ostream& operator<<(ostream& os, tuple const& t) { bool f = true; apply([&](auto&&... x) { ((os << (f ? f = false, "" : " ") << x), ...); }, t); return os; } template istream& operator>>(istream& is, tuple& t) { apply([&](auto&&... x) { ((is >> x), ...); }, t); return is; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define def(name, ...) auto name = MakeFixPoint() | [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << '\n'; exit(0); } template constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; } template constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits::value_type{}); } template ()))> constexpr auto min(T const& a) { return *min_element(begin(a), end(a)); } template ()))> constexpr auto max(T const& a) { return *max_element(begin(a), end(a)); } template constexpr T min(set const& st) { assert(st.size()); return *st.begin(); } template constexpr T max(set const& st) { assert(st.size()); return *prev(st.end()); } template constexpr T min(multiset const& st) { assert(st.size()); return *st.begin(); } template constexpr T max(multiset const& st) { assert(st.size()); return *prev(st.end()); } constexpr ll max(signed x, ll y) { return max(x, y); } constexpr ll max(ll x, signed y) { return max(x, y); } constexpr ll min(signed x, ll y) { return min(x, y); } constexpr ll min(ll x, signed y) { return min(x, y); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); } template int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); } constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; } constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); } constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); } constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 }; constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 }; auto four_nbd(int n, int m) { static vector> v; return [n, m](int i, int j) { const int dx[] = { 1, 0, -1, 0 }, dy[] = { 0, 1, 0, -1 }; v.clear(); rep (dir, 4) { int ni = i+dx[dir], nj = j+dy[dir]; if (0 <= ni and ni < n and 0 <= nj and nj < m) { v.emplace_back(ni, nj); } } return v; }; }; template vector iota(int n, Comp comp) { vector idx(n); iota(begin(idx), end(idx), 0); stable_sort(begin(idx), end(idx), comp); return idx; } constexpr int popcnt(ll x) { return __builtin_popcountll(x); } mt19937_64 seed_{random_device{}()}; template Int rand(Int a, Int b) { return uniform_int_distribution(a, b)(seed_); } i64 irand(i64 a, i64 b) { return rand(a, b); } // [a, b] u64 urand(u64 a, u64 b) { return rand(a, b); } // template void shuffle(It l, It r) { shuffle(l, r, seed_); } template V &operator--(V &v) { for (auto &x : v) --x; return v; } template V &operator++(V &v) { for (auto &x : v) ++x; return v; } bool next_product(vector &v, int m) { repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0; return false; } bool next_product(vector &v, vector const& s) { repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0; return false; } template int sort_unique(vec &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); return v.size(); } template auto prefix_sum(It l, It r) { vector s = { 0 }; while (l != r) s.emplace_back(s.back() + *l++); return s; } template auto suffix_sum(It l, It r) { vector s = { 0 }; while (l != r) s.emplace_back(*--r + s.back()); reverse(s.begin(), s.end()); return s; } template T pop(vector &a) { auto x = a.back(); a.pop_back(); return x; } template T pop_back(vector &a) { auto x = a.back(); a.pop_back(); return x; } template T pop(priority_queue &a) { auto x = a.top(); a.pop(); return x; } template T pop(queue &a) { auto x = a.front(); a.pop(); return x; } template T pop_front(deque &a) { auto x = a.front(); a.pop_front(); return x; } template T pop_back(deque &a) { auto x = a.back(); a.pop_back(); return x; } template T pop_front(set &a) { auto x = *a.begin(); a.erase(a.begin()); return x; } template T pop_back(set &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; } template T pop_front(multiset &a) { auto it = a.begin(); auto x = *it; a.erase(it); return x; } template T pop_back(multiset &a) { auto it = prev(a.end()); auto x = *it; a.erase(it); return x; } // <<< // >>> modint template class modint { static_assert(md < (1u<<31), ""); using M = modint; using i64 = int64_t; uint32_t x; public: static constexpr uint32_t mod = md; constexpr modint(i64 x = 0) : x((x%=md) < 0 ? x+md : x) { } constexpr i64 val() const { return x; } constexpr explicit operator i64() const { return x; } constexpr bool operator==(M r) const { return x == r.x; } constexpr bool operator!=(M r) const { return x != r.x; } constexpr M operator+() const { return *this; } constexpr M operator-() const { return M()-*this; } constexpr M& operator+=(M r) { x += r.x; x = (x < md ? x : x-md); return *this; } constexpr M& operator-=(M r) { x += md-r.x; x = (x < md ? x : x-md); return *this; } constexpr M& operator*=(M r) { x = (uint64_t(x)*r.x)%md; return *this; } constexpr M& operator/=(M r) { return *this *= r.inv(); } constexpr M operator+(M r) const { return M(*this) += r; } constexpr M operator-(M r) const { return M(*this) -= r; } constexpr M operator*(M r) const { return M(*this) *= r; } constexpr M operator/(M r) const { return M(*this) /= r; } friend constexpr M operator+(i64 x, M y) { return M(x)+y; } friend constexpr M operator-(i64 x, M y) { return M(x)-y; } friend constexpr M operator*(i64 x, M y) { return M(x)*y; } friend constexpr M operator/(i64 x, M y) { return M(x)/y; } constexpr M inv() const { assert(x > 0); return pow(md-2); } constexpr M pow(i64 n) const { // assert(not (x == 0 and n == 0)); if (n < 0) return inv().pow(-n); M v = *this, r = 1; for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v; return r; } #ifdef LOCAL friend string to_s(M r) { return to_s(r.val(), mod); } #endif friend ostream& operator<<(ostream& os, M r) { return os << r.val(); } friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; } }; // <<< constexpr int64_t MOD = 998244353; //constexpr int64_t MOD = 1e9+7; using mint = modint; mint sign(int n) { return n & 1 ? -1 : +1; } // >>> mod table template struct ModTable { vector fact, finv; void calc(int n) { assert(n < int(1e9)); int old = fact.size(); if (n < old) return; n += 1000; fact.resize(n+1); finv.resize(n+1); if (old == 0) { fact[0] = fact[1] = finv[0] = finv[1] = 1; old = 2; } for (auto i = old; i <= n; i++) fact[i] = fact[i-1] * i; finv[n] = mint(1) / fact[n]; for (auto i = n-1; i >= old; i--) finv[i] = finv[i+1] * (i+1); } }; ModTable mod_tab; mint fact(int n) { assert(0 <= n); return mod_tab.calc(n), mod_tab.fact[n]; } mint finv(int n) { assert(0 <= n); return mod_tab.calc(n), mod_tab.finv[n]; } mint comb(int n, int k) { if (n < 0 || k < 0 || n < k) return 0; mod_tab.calc(n); return mod_tab.fact[n] * mod_tab.finv[k] * mod_tab.finv[n-k]; } mint perm(int n, int k) { assert(k >= 0); assert(n >= k); mod_tab.calc(n); return mod_tab.fact[n] * mod_tab.finv[n-k]; } // <<< // >>> union find struct UnionFind { int n, sz; // id : 0...n-1 vector par; UnionFind(int n = 0) : n(n), sz(n), par(n, -1) { } void clear() { rep (i, n) par[i] = -1; sz = n; } int root(int x) { assert(0 <= x); assert(x < n); return par[x] < 0 ? x : par[x] = root(par[x]); } bool unite(int x, int y) { x = root(x), y = root(y); if (x == y) return false; sz--; if (par[x] < par[y]) swap(x, y); par[y] += par[x]; par[x] = y; return true; } bool same(int x, int y) { return root(x) == root(y); } int size(int x) { return -par[root(x)]; } int size() const { return sz; } vector> groups() { vector> g(n); rep (i, n) if (par[i] < 0) g[i].reserve(-par[i]); rep (i, n) g[root(i)].push_back(i); vector> grp; grp.reserve(size()); rep (i, n) if (g[i].size()) grp.emplace_back(move(g[i])); return grp; } }; // <<< // >>> sieve namespace Sieve { constexpr int MAX = 2e5; vector ps, pf; // primes, min prime factor auto sieve_init = [](){ pf.resize(MAX+1); iota(pf.begin(), pf.end(), 0); for (int i = 2; i <= MAX; ++i) { if (pf[i] == i) ps.push_back(i); for (int p : ps) { const int x = p*i; if (p > pf[i] || x > MAX) break; pf[x] = p; } } return 0; }(); bool is_prime(int n) { assert(0 <= n); assert(n <= MAX); return pf[n] == n && n >= 2; } vector> const& prime_factor(int n) { assert(0 <= n); assert(n <= MAX); static vector> ret; ret.clear(); uint32_t m = n; while (m > 1u) { uint32_t p = pf[m], i = 0; do m /= p, ++i; while ((uint32_t)pf[m] == p); ret.emplace_back(p, i); } return ret; } vector const& divisors(int n) { assert(0 <= n); assert(n <= MAX); static vector ret; ret.clear(); ret.push_back(1); for (auto p : prime_factor(n)) { int m = ret.size(); for (int i = 0; i < m; ++i) { for (int j = 0, v = 1; j < p.second; ++j) { v *= p.first; ret.push_back(ret[i]*v); } } } return ret; } } using namespace Sieve; // <<< int32_t main() { int n, a, b; cin >> n >> a >> b; if (a == 1 and b == 1) quit(1); if (a == 1 or b == 1) quit(2); vector p(n); iota(all(p), 0); reverse(p.begin(), p.begin() + a); reverse(p.end() - b, p.end()); UnionFind uf(n); rep (x, n) uf.unite(x, p[x]); vector cnt(MAX+1); rep (x, n) if (uf.root(x) == x) { int s = uf.size(x); for (auto [p, k] : prime_factor(s)) { chmax(cnt[p], k); } } mint m = 1; rep (i, cnt.size()) if (cnt[i] > 0) { m *= mint(i).pow(cnt[i]); } cout << 2*m << '\n'; }