#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

void debug(vector<mint> &v) {
    rep(i, v.size()) { cerr << v[i].val() << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

mint comb(ll n, ll r, vector<mint> &fact, vector<mint> &fact_inv) {
    mint ret = 0;
    if (r < 0) {
        return ret.val();
    } else if (n < r) {
        return ret.val();
    }
    ret = 1;
    ret *= fact[n];
    ret *= fact_inv[n - r];
    ret *= fact_inv[r];
    return ret.val();
}

int main() {
    ll N, M, K;
    cin >> N >> M >> K;
    vector<ll> X(K);
    vector<ll> Y(K);
    for (ll i = 0; i < K; i++) {
        cin >> X[i] >> Y[i];
    }
    map<ll, ll> mp;
    for (ll i = 0; i < K; i++) {
        mp[X[i]]++;
        mp[Y[i]]++;
    }
    ll subh = M;
    ll mainh = N - M;
    vector<ll> vecs(0);
    ll now = 0;
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        itr->second = now;
        if (itr->first <= M) {
            subh--;
        } else {
            mainh--;
        }
        vecs.push_back(itr->first);
        now++;
    }
    vector<mint> bitdp1(1 << now, 0);
    vector<mint> bitdp2(1 << now, 0);
    for (ll i = 0; i < now; i++) {
        if (vecs[i] <= M) {
            bitdp1[1 << i] += 1;
        } else {
            bitdp2[1 << i] += 1;
        }
    }
    vector<vector<bool>> allowed(now, vector<bool>(now, true));
    for (ll i = 0; i < K; i++) {
        allowed[mp[Y[i]]][mp[X[i]]] = false;
    }
    for (ll i = 0; i < (1 << now); i++) {
        for (ll j = 0; j < now; j++) {
            if ((i >> j) & 1) {
                continue;
            }
            bool pos = true;
            for (ll k = 0; k < now; k++) {
                if ((i >> k) & 1) {
                    if (!allowed[k][j]) {
                        pos = false;
                    }
                }
            }
            if (pos) {
                bitdp1[i + (1 << j)] += bitdp1[i];
                bitdp2[i + (1 << j)] += bitdp2[i];
            }
        }
    }
    if (now == 0) {
        bitdp2[0] = 1;
    }
    vector<mint> fact(1050001);
    fact[0] = 1;
    for (ll i = 0; i < 1050000; i++) {
        fact[i + 1] = fact[i] * (i + 1);
    }
    vector<mint> fact_inv(1050001);
    for (ll i = 0; i < 1050001; i++) {
        fact_inv[i] = 1 / fact[i];
    }

    mint ans = 0;

    // 最初が K 個の中に入らない場合
    // 最初は絶対メインなので mainh 通り
    // 残りの並び順で (subh + mainh - 1)! 通り
    // 残りの挿入場所の選択で comb(N - 1, now) 通り
    ans += mainh * fact[subh + mainh - 1] *
           (bitdp1[(1 << now) - 1] + bitdp2[(1 << now) - 1]) *
           comb(N - 1, now, fact, fact_inv);

    // 最初が K 個の中に入る場合
    // 最初は絶対メインなので bitdp2 のみ使用する
    // 残りの並び順は (subh + mainh)! 通り
    // 残りの挿入場所の選択で comb(N - 1, now - 1) 通り
    ans += fact[subh + mainh] * bitdp2[(1 << now) - 1] *
           comb(N - 1, now - 1, fact, fact_inv);
    cout << ans.val() << endl;
}