#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
//const int MOD = 1000000007;
const int MOD = 998244353;

vl fac, finv, inv;

void nCr_init(int MAX) {
	MAX += 2;
	fac.resize(MAX);
	finv.resize(MAX);
	inv.resize(MAX);
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < MAX; i++) {
		fac[i] = fac[i - 1] * i % MOD;
		inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
		finv[i] = finv[i - 1] * inv[i] % MOD;
	}
}

long long nCr(int n, int r) {
	if (n < r) return 0;
	if (n < 0 || r < 0) return 0;
	return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}


int main() {
	int n, a, b;
	cin >> n >> a >> b;
	nCr_init(n);
	ll ans = 1;
	ll tmp1, tmp2 = 1;

	for (int i = 1; i <= n - 2; i++) {
		tmp2 *= i;
		tmp2 %= MOD;
	}
	tmp1 = tmp2 * (n - 1);
	tmp1 %= MOD;
	ans = tmp1 * n;
	ans %= MOD;
	if (a == b) {
		ans -= tmp1 * 2;

	}
	else {
		ans -= tmp1 * 2 - tmp2;
	}
	ans += MOD * 2;
	ans %= MOD;
	cout << ans << endl;

	return 0;
}