#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

template<typename T>
class Compress{
    public:
    vector<T> data;
    int offset;
    Compress(vector<T> data_, int offset=0): offset(offset){
        data = data_;
        sort(begin(data), end(data));
        data.erase(unique(begin(data), end(data)), end(data));
    };
    int operator[](T x) {
        auto p = lower_bound(data.begin(), data.end(), x);
        assert(x == *p);
        return offset+(p-data.begin());
	}
    T inv(int x){
        return data[x-offset];
    }
    int size(){
        return data.size();
    }
};


#define N_MAX 2000002
mint inv[N_MAX],fac[N_MAX],finv[N_MAX];

void init(){
    const ll MOD = mint::mod();
    fac[0]=1;fac[1]=1;
    finv[0]=1;finv[1]=1;
    inv[1]=1;
    for(int i=2;i<N_MAX;i++){
        inv[i]=mint(MOD)-inv[MOD%i]*(MOD/i);
        fac[i]=fac[i-1]*(ll) i;
        finv[i]=finv[i-1]*inv[i];
    }
}

mint comb(ll n, ll r){
    if(n < r){
        return mint(0);
    }else{
        return fac[n]*finv[r]*finv[n-r];
    }
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int n, m, k; cin >> n >> m >> k;
    vector<int> x(k), y(k);
    vector<int> v;
    for(int i = 0; i < k; i++){
        cin >> x[i] >> y[i]; x[i]--; y[i]--;
        v.push_back(x[i]);
        v.push_back(y[i]);
    }
    auto cp = Compress<int>(v);
    vector<int> prev_mask(cp.size());
    for(int i = 0; i < k; i++){
        int u = cp[x[i]];
        int v = cp[y[i]];
        prev_mask[v] |= 1<<u;
    }
    // 2つめはmainから始まるか？(1がYES)
    auto dp = vec2d(1<<cp.size(), 2, mint(0));
    for(int i = 0; i < cp.size(); i++){
        int x = cp.data[i];
        if(prev_mask[i] == 0){
            int j = x < m ? 0 : 1;
            dp[1<<i][j] += 1;
        }
    }

    for(int s = 1; s < (1<<cp.size()); s++){
        for(int j = 0; j < cp.size(); j++){
            if(s&(1<<j)) continue;
            if((prev_mask[j]&s) != prev_mask[j]) continue;
            for(int k = 0; k < 2; k++){
                dp[s|(1<<j)][k] += dp[s][k];
            }
        }
    }
    dp[0][0] = 1;
    // for(int s = 0; s < (1<<cp.size()); s++){
    //     cout << dp[s][0] << ':' << dp[s][1] << endl;
    // }
    // print_vector(prev_mask);
    int cnt_main = n-m, cnt_sub = m;
    for(int x: cp.data){
        if(x < m) cnt_sub--;
        else cnt_main--;
    }
    int s = cp.size();
    mint ans = 0;
    int all_bits = (1<<cp.size())-1;
    for(int k = 0; k < 2; k++){
        if(cnt_main > 0){
            ans += cnt_main*comb(n-1, s)*dp[all_bits][k]*fac[cnt_main+cnt_sub-1];
        }
        if(k == 1 && s > 0){
            ans += comb(n-1, s-1)*dp[all_bits][k]*fac[cnt_main+cnt_sub];
        }
    }
    cout << ans << endl;
}