#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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 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; }
struct combination {
	std::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 < (int)fact.size());
		mint val = ifact[k];
		for (int i = 0; i < k; ++i) val *= n - i;
		return val;
	}
	mint div(int x) {
		if (x >= (int)fact.size())return mint(x).inv();
		return fact[x - 1] * ifact[x];
	}
	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);
template <class S>
struct value_compression : std::vector<S> {
	bool built = false;
	using VS = std::vector<S>;
	using VS::VS;
	value_compression(std::vector<S> v = {}) : std::vector<S>(move(v)) {}
	void build() {
		std::sort(this->begin(), this->end());
		this->erase(unique(this->begin(), this->end()), this->end());
		built = true;
	}
	template <class T>
	void convert(T first, T last) {
		assert(built);
		for (; first != last; ++first) *first = (*this)(*first);
	}
	int operator()(S x) {
		assert(built);
		return lower_bound(this->begin(), this->end(), x) - this->begin();
	}
	void clear() {
		this->clear();
		built = false;
	}
};
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, k; cin >> n >> m >> k;
	vector<P>xy(k);
	value_compression<int> vc;
	rep(i, k) {
		int x, y; cin >> x >> y;
		x--, y--;
		xy[i] = { x,y };
		vc.emplace_back(x);
		vc.emplace_back(y);
	}
	vc.build();
	rep(i, k) xy[i] = { vc(xy[i].first),vc(xy[i].second) };
	int main = n - m;
	rep(i, vc.size())main -= vc[i] >= m;
	int sz = vc.size();
	vector<int>constraints(sz);// iより前にあってはないけない要素の集合
	for (auto[x, y] : xy) constraints[y] |= 1 << x;
	vector<mint>dp(1 << sz);
	dp[0] = main * c.fact[n - 1 - sz] * c(n - 1, sz);
	rep(i, sz) {
		// last fix
		if (constraints[i])continue;
		if (vc[i] < m)continue;
		dp[1 << i] = c.fact[n - sz] * c(n - 1, sz - 1);
	}
	rep(i, 1 << sz) {
		rep(j, sz) {
			if (1 & (i >> j))continue;
			if ((constraints[j] & i) != constraints[j])continue;
			dp[i + (1 << j)] += dp[i];
		}
	}
	cout << dp.back().val() << endl;
	return 0;
}