#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

const ll mod = 998244353;

int main(){
  ll N; cin >> N;
  ll A,B; cin >> A >> B;
  vector<ll> fac(N+1);
  fac[0]=fac[1]=1;
  for(ll i=2;i<=N;i++){
    fac[i] = fac[i-1]*i%mod;
  }
  ll al = fac[N];
  ll m1 = fac[N-1];
  al += (mod-m1)*2;
  if(A!=B) al += fac[N-2];
  cout << al % mod << endl;
  return 0;
}