#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long

using namespace std;

const int kmax = 1e6 + 3;
const int Mod = 998244353;

int t, n, m;
int s[kmax];
int pos[kmax];
long long fac[kmax];

struct Fenwick {

  long long c[kmax];

  int Lowbit(int x) {
    return x & -x;
  }

  void Modifyup(int x, long long v) {
    for(; x <= n; x += Lowbit(x)) {
      c[x] = (c[x] + v) % Mod;
    }
  }

  void Modifydown(int x, long long v) {
    for(; x; x -= Lowbit(x)) {
      c[x] = (c[x] + v) % Mod;
    }
  }

  long long Getresup(int x) {
    long long tot = 0;
    for(; x <= n; x += Lowbit(x)) {
      tot = (tot + c[x]) % Mod;
    }
    return tot;
  }

  long long Getresdown(int x) {
    long long tot = 0;
    for(; x; x -= Lowbit(x)) {
      tot = (tot + c[x]) % Mod;
    }
    return tot;
  }

  void Clear() {
    for(int i = 1; i <= n; i++) c[i] = 0;
  }
} fw[4];

long long C(long long x, long long y) {
  if(y == 2) return x * (x - 1) / 2 % Mod;
  return x * (x - 1) / 2 * (x - 2) / 3 % Mod;
}

long long Fac(long long x) {
  if(x < 0) return 0;
  return fac[x];
}

long long Sum(int l, int r) {
  if(l > r) return 0;
  return s[r] - s[l - 1];
}

void Solve() {
  cin >> n >> m;
  for(int i = 0; i < 4; i++) fw[i].Clear();
  for(int i = 1; i <= n; i++) s[i] = 1, pos[i] = 0;
  for(int i = 1, x, y; i <= m; i++) {
    cin >> x >> y;
    pos[x] = y;
    s[y] = 0;
  }  
  for(int i = 1; i <= n; i++) s[i] += s[i - 1];
  fac[0] = 1;
  for(int i = 1; i <= n; i++) fac[i] = fac[i - 1] * i % Mod;
  long long res = 0;
  long long sw = 0;
  for(int i = 2, zero = 0; i <= n; i++) {
    int x = pos[i - 1], y = pos[i];
    if(!x && !y) {
      res = (res + C(s[n], 2) * Fac(s[n] - 2) % Mod) % Mod; 
      res = (res + 1ll * zero * C(s[n], 3) % Mod * Fac(s[n] - 3) % Mod);
      res = (res + sw * Fac(s[n] - 2) % Mod) % Mod;
    } else if(!x) {
      int ss = Sum(y, n);
      res = (res + ss * Fac(s[n] - 1) % Mod) % Mod;
      res = (res + (fw[2].Getresdown(n) - fw[2].Getresdown(y)) * Fac(s[n] - 1) % Mod) % Mod;
      res = (res + 1ll * zero * C(ss, 2) % Mod * Fac(s[n] - 2) % Mod) % Mod;
    } else if(!y) {
      int ss = Sum(1, x);
      res = (res + ss * Fac(s[n] - 1) % Mod) % Mod;
      res = (res + fw[1].Getresdown(x - 1) * Fac(s[n] - 1) % Mod) % Mod;
      res = (res + 1ll * zero * C(ss, 2) % Mod * Fac(s[n] - 2) % Mod) % Mod;
    } else if(x > y) {
      int ss = Sum(y, x);
      res = (res + Fac(s[n])) % Mod;
      res = (res + 1ll * zero * ss % Mod * Fac(s[n] - 1) % Mod) % Mod;
      res = (res + 1ll * (fw[0].Getresdown(x) - fw[0].Getresdown(y - 1)) * Fac(s[n]) % Mod) % Mod;
    }
    if(pos[i - 1]) {
      sw = (sw + 1ll * Sum(1, pos[i - 1]) * Sum(pos[i - 1], n) % Mod) % Mod;
      fw[0].Modifyup(pos[i - 1], 1);
      fw[1].Modifyup(pos[i - 1], Sum(1, pos[i - 1]));
      fw[2].Modifyup(pos[i - 1], Sum(pos[i - 1], n));
    } else {
      zero++;
    }
  }
  cout << res << '\n';
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> t;
  while(t--) Solve();
  return 0;
}