MOD = 998244353

N, M = map(int, input().split())
PK = [list(map(int, input().split())) for _ in range(M)]

# N: 処理する区間の長さ
N0 = 2 ** (N + 1).bit_length()
data = [0] * (2 * N0)

# a_k の値を x に更新
def update(k, x):
    k += N0 - 1
    data[k] = x  # 加算にするなら+=に
    while k >= 0:
        k = (k - 1) // 2
        data[k] = data[2 * k + 1] + data[2 * k + 2]

# 区間[l, r)の区間和
def query(l, r):
    s = 0
    L = l + N0;
    R = r + N0
    while L < R:
        if R & 1:
            R -= 1
            s += data[R - 1]
        if L & 1:
            s += data[L - 1]
            L += 1
        L >>= 1;
        R >>= 1
    return s

fact = [1] * (N + 1)
r = 1
for i in range(1, N + 1):
    fact[i] = r = r * i % MOD

ans = (N - M) * (N - M - 1) // 2
ans %= MOD
ans *= fact[N - M]
ans //= 2
ans %= MOD
#print(ans)

PK.sort(key=lambda x: x[1])

cnt = 0
for i, (p, k) in enumerate(PK, start=1):
    update(p, 1)
    cnt += query(p + 1, N + 1)
    cnt %= MOD

cnt *= fact[N - M]
ans += cnt
ans %= MOD
#print(ans)

tmp3 = 0
for i, (p, k) in enumerate(PK, start=1):
    tmp = k - i
    tmp2 = N - M - tmp
    tmp3 += (N - p - query(p + 1, N + 1)) * tmp
    tmp3 += (p - query(0, p + 1)) * tmp2
    tmp3 %= MOD
tmp3 *= fact[N - M - 1]
tmp3 %= MOD
ans += tmp3
ans %= MOD
print(ans)