#include<bits/stdc++.h>
using namespace std;
using ll = long long;


const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

template< typename T >
struct BIT{
    int n;
    vector<T> data;
    BIT(int n):n(n),data(n+1,0){}

    void add(int i,T x){
        i++;
        while(i<=n){
            data[i] += x;
            i += i & (-i);
        }
    }

    //sum of [l,r)
    T sum(int l,int r){
        return sum(r-1)-sum(l-1);
    }

    T sum(int i){
        i++;
        T now = 0;
        while(i>0){
            now += data[i];
            i -= i & (-i);
        }
        return now;
    }
};

mint fac[2<<17];
int main(){
    fac[0] = 1;
    for(int i = 1;i<2<<17;i++) fac[i] = fac[i-1] * mint(i);
    mint sum = 0;
    int n,m;
    cin>>n>>m;
    vector<int> now(n,-1);
    vector<int> use(n,-1);
    for(int i = 0;i<m;i++){
        int p,k;
        cin>>p>>k;
        p--;k--;
        use[p] = k;
        now[k] = p;
    }
    BIT<mint> bit(n);
    int can = n - m;
    for(int i = 0;i<n;i++){
        if(now[i] == -1) continue;
        sum += bit.sum(now[i],n);
        bit.add(now[i],1);
    }
    sum *= fac[can];
    if(can==0){
        cout<<sum<<endl;
        return 0;
    }
    BIT<mint> b(n);
    mint tmp = 0;
    mint ans = 0;
    for(int i= 0;i<n;i++) if(now[i]==-1) b.add(i,1);
    for(int i = 0;i<n;i++) {
        if(use[i]==-1) ans += tmp;
        else tmp += b.sum(0,use[i]);
    }
    ans *= fac[can-1];
    ans += sum;
    tmp = 0;
    mint nn = 0;
    for(int i = n - 1;i>=0;i--){
        if(use[i]==-1) nn += tmp;
        else tmp += b.sum(use[i],n);
    }
    ans += nn * fac[can-1];
    if(can>=2){
        tmp = fac[can] * fac[2].inv() * fac[can-2].inv();
        tmp *= tmp;
        tmp *= fac[can-2];
        ans += tmp;
    }
    cout<<ans<<endl;

}