#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
	vector<mint> fact, ifact;
	combination(int n) :fact(n + 1), ifact(n + 1) {
		assert(n < mod);
		fact[0] = 1;
		for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
		ifact[n] = fact[n].inv();
		for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
	}
	mint operator()(int n, int k) { return com(n, k); }
	mint com(int n, int k) {
		//負の二項係数を考慮する場合にコメントアウトを外す
		//if (n < 0) return com(-n, k) * (k % 2 ? -1 : 1);
		if (k < 0 || k > n) return 0;
		return fact[n] * ifact[k] * ifact[n - k];
	}
	mint comsub(long long n, long long k) {
		if (n - k < k) k = n - k;
		assert(k < fact.size());
		mint val = ifact[k];
		rep(i, k) val *= n - i;
		return val;
	}
	mint inv(int n, int k) {
		//if (n < 0) return inv(-n, k) * (k % 2 ? -1 : 1);
		if (k < 0 || k > n) return 0;
		return ifact[n] * fact[k] * fact[n - k];
	}
	mint p(int n, int k) { return fact[n] * ifact[n - k]; }
}c(2000006);
long long op(long long a, long long b) { return a + b; }
long long e() { return 0; }
long long calc(vector<int>v) {
	auto tmp = v;
	sort(all(tmp));
	tmp.erase(unique(all(tmp)), tmp.end());
	rep(i, v.size()) v[i] = lower_bound(all(tmp), v[i]) - tmp.begin();
	long long ret = 0;
	segtree<long long, op, e>seg(tmp.size());
	rep(i, v.size()) {
		ret += seg.prod(v[i] + 1, tmp.size());
		seg.set(v[i], seg.get(v[i]) + 1);
	}
	return ret;
}
bool comp(const P& lh, const P& rh) {
	return lh.second < rh.second;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	mint ans = 0;
	vector<P>vp(m);
	rep(i, m) {
		cin >> vp[i].first >> vp[i].second;
		vp[i].first--, vp[i].second--;
	}
	sort(all(vp), comp);
	vector<int>v;
	rep(i, vp.size()) v.push_back(vp[i].first);
	// 固定同士
	{
		auto tmp = calc(v);
		ans += (mint)tmp * c.fact[n - m];
	}
	// そうじゃないやつ同士
	if (n - m >= 2) {
		ans += c(n - m, 2)*c(n - m, 2) *c.fact[n - m - 2];
	}
	// 固定とそうじゃないやつ
	if (n != m) {
		sort(all(v));
		rep(i, vp.size()) {
			int cntUp = (n - vp[i].first) - (v.end() - lower_bound(all(v), vp[i].first));
			int cntDown = vp[i].first - (lower_bound(all(v), vp[i].first) - v.begin());
			ans += c.fact[n - m - 1] * cntUp *(vp[i].second - i);
			ans += c.fact[n - m - 1] * cntDown *((n - m) - (vp[i].second - i));
		}
	}
	cout << ans.val() << endl;
	return 0;
}