#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI a(n, -1);
  rep(_, m) {
    int p, k;
    cin >> p >> k;
    a[k-1] = p-1;
  }
  mint ans;
  {
    fenwick_tree<int> ft(n);
    rep(i, n) if (a[i] != -1) {
      ans += ft.sum(a[i], n);
      ft.add(a[i], 1);
    }
    ans *= Fact[n - m];
  }
  {
    ans += comb(n - m, 2) * Fact[n - m] / 2;
  }
  if (n - m - 1 >= 0) {
    int bl = 0;
    VI rest(n, 1);
    rep(i, n) if (a[i] != -1) rest[a[i]] = 0;
    VI sm(n + 1);
    rep(i, n) sm[i + 1] = sm[i] + rest[i];
    rep(i, n) {
      if (a[i] == -1) {
        bl++;
        continue;
      }
      int br = n - m - bl;
      int smaller = sm[a[i]], larger = sm[n] - sm[a[i] + 1];
      ans += (mint(smaller) * br + mint(larger) * bl) * Fact[n - m - 1];
    }
  }
  cout << ans.val() << '\n';
}