#include <atcoder/all>

#include <bits/stdc++.h>

using namespace std;
#define SZ(x) (int) (x).size()
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(auto i = (a); i < (b); i++)
#define For(i, a, b, c) \
	for(auto i = (a); i != (b); i += (c))
#define REPR(i, n) for(auto i = (n) -1; i >= 0; i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase(unique(ALL(v)), (v).end())
#define eb emplace_back

typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> PI;
typedef pair<ll, ll> PL;
const double EPS = 1e-6;
const int MOD = 1e9 + 7;
const int INF = (1 << 30);
const ll LINF = 1e18;
const double math_PI = acos(-1);

template<typename T>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(
		a, make_v<T>(ts...));
}

template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(
	T& t, const V& v) {
	t = v;
}

template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(
	T& t, const V& v) {
	for(auto& e: t) fill_v(e, v);
}

template<class T>
bool chmax(T& a, const T& b) {
	if(a < b) {
		a = b;
		return true;
	}
	return false;
}

template<class T>
bool chmin(T& a, const T& b) {
	if(a > b) {
		a = b;
		return true;
	}
	return false;
}

template<typename S, typename T>
istream& operator>>(istream& is, pair<S, T>& p) {
	cin >> p.first >> p.second;
	return is;
}

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	for(T& x: vec) is >> x;
	return is;
}

template<typename T>
string join(vector<T>& vec, string splitter) {
	stringstream ss;
	REP(i, SZ(vec)) {
		if(i != 0) ss << splitter;
		ss << vec[i];
	}
	return ss.str();
}

template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	os << join(vec, " ");
	return os;
}
template<typename T>
struct Comb {
private:
	vector<T> _fact;
	vector<T> inv;
	int pre_build;
	void expand(int x) {
		if(pre_build == -1) return;
		while(SZ(_fact) <= x) {
			int next = SZ(_fact);
			_fact.push_back(_fact[next - 1] * next);
			inv.push_back(_fact[next].inv());
		}
	}

	T nPr_calc(int n, int r) {
		T ret = 1;
		for(int i = n; i > n - r; i--) ret *= i;
		return ret;
	}
	T nCr_calc(int n, int r) {
		T ret = 1;
		REP(i, r) {
			ret *= n - i;
			ret /= i + 1;
		}
		return ret;
	}

public:
	Comb(int pre_build = 0): pre_build(pre_build) {
		if(pre_build == -1) {
			return;
		}
		_fact = vector<T>(pre_build + 1);
		_fact[0] = 1;
		inv = vector<T>(pre_build + 1);
		REP(i, pre_build) {
			_fact[i + 1] = _fact[i] * (i + 1);
		}
		inv[pre_build] = _fact[pre_build].inv();
		REPR(i, pre_build) {
			inv[i] = inv[i + 1] * (i + 1);
		}
	}
	T nPr(int n, int r) {
		assert(r >= 0);
		assert(n >= r);
		expand(n);
		if(pre_build == -1) return nPr_calc(n, r);
		return _fact[n] * inv[n - r];
	}
	T nCr(int n, int r) {
		assert(r >= 0);
		assert(n >= r);
		expand(n);
		if(pre_build == -1) return nCr_calc(n, r);
		return _fact[n] * inv[r] * inv[n - r];
	}
	T nHr(int n, int r) {
		assert(r >= 0);
		assert(n >= 1);
		expand(n + r - 1);
		return nCr(n + r - 1, r);
	}
	T type_permission(vi V) {
		assert(pre_build != -1);
		int sum = 0;
		for(int i: V) {
			assert(i >= 0);
			sum += i;
		}
		expand(sum);
		T ans = _fact[sum];
		for(int i: V) ans *= inv[i];
		return ans;
	}
	T fact(int n) {
		expand(n);
		return _fact[n];
	}
	T inv_fact(int n) {
		expand(n);
		return inv[n];
	}
};
using namespace atcoder;
using mint = modint998244353;

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int N, A, B;
	cin >> N >> A >> B;
	Comb<mint> comb(N);
	if(A == B) {
		cout << (mint(N - 1) * mint(N - 2)
				 * comb.fact(N - 2))
					.val()
			 << endl;
	} else {
		cout << ((mint(N - 1) + mint(N - 2) * mint(N - 2))
				 * comb.fact(N - 2))
					.val()
			 << endl;
	}
	return 0;
}