#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
using mint = modint998244353;

int main(){
  int n,x,y;
  cin >> n >> x >> y;
  mint a = 1;
  mint b = 1;
  mint c = 1;
  for (int i = 0; i < n;i++){
    c *= (i+1);
    if (i < n-1) a *= (i+1);
    if (i < n-2) b *= (i+1);
  }
  if (x == y) b = 0;
  cout << (c-a-a+b).val() << endl;

  

  return 0;
}