//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <cassert>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
using namespace std;
using lg = long long;
#define TEST clog << "TEST" << endl
#define IINF 2147483647
#define LLINF 9223372036854775807LL
//#define AMARI 1000000007
#define AMARI 998244353
#define TEMOTO ((sizeof(long double) == 16) ? false : true)
#define TIME_LIMIT 1980 * (TEMOTO ? 1 : 1000)
#define el '\n'
#define El '\n'

#define MULTI_TEST_CASE false
void solve(void) {
    int n, a, b;
    cin >> n >> a >> b;
    if (a == b) {
        //n! - (n-1)!
        lg ans = 1;
        for (int i = 0; i < n; i++) {
            ans *= (i + 1);
            ans %= AMARI;
        }
        lg temp = 1;
        for (int i = 0; i < n - 1; i++) {
            temp *= (i + 1);
            temp %= AMARI;
        }
        ans -= 2 * temp;
        if (ans < 0)ans += (lg)AMARI * 10LL;
        ans %= AMARI;
        cout << ans << el;
    }
    else {
        //n! - 2(n-1)!  +(n-2)!
        lg ans = 1;
        for (lg i = 0; i < n; i++) {
            ans *= (i + 1);
            ans %= AMARI;
        }
        lg temp = 1;
        for (lg i = 0; i < n - 1; i++) {
            temp *= (i + 1);
            temp %= AMARI;
        }
        ans -= 2 * temp;
        if (ans < 0)ans += (lg)AMARI * 10LL;
        ans %= AMARI;
        temp = 1;
        for (lg i = 0; i < n - 2; i++) {
            temp *= (i + 1);
            temp %= AMARI;
        }
        ans += temp;
        ans %= AMARI;
        cout << ans << el;
        
    }
    return;
}

void calc(void) {
    return;
}

int main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    if (MULTI_TEST_CASE)cin >> t;
    while (t--) {
        solve();
    }
    //calc();
    return 0;
}