#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
#include<atcoder/modint>
using namespace std;
#include<vector>
template<typename T>
struct combination{
	vector<T>fac,ifac;
	combination(size_t N=0):fac(1,1),ifac(1,1)
	{
		make_table(N);
	}
	void make_table(size_t N)
	{
		if(fac.size()>N)return;
		size_t now=fac.size();
		N=max(N,now*2);
		fac.resize(N+1);
		ifac.resize(N+1);
		for(size_t i=now;i<=N;i++)fac[i]=fac[i-1]*i;
		ifac[N]=1/fac[N];
		for(size_t i=N;i-->now;)ifac[i]=ifac[i+1]*(i+1);
	}
	T factorial(size_t n)
	{
		make_table(n);
		return fac[n];
	}
	T invfac(size_t n)
	{
		make_table(n);
		return ifac[n];
	}
	T P(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*ifac[n-k];
	}
	T C(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*ifac[n-k]*ifac[k];
	}
	T H(size_t n,size_t k)
	{
		if(n==0)return k==0?1:0;
		return C(n-1+k,k);
	}
};
using mint=atcoder::modint998244353;
combination<mint>C;
int N,M,K;
int X[380],Y[380];
mint dp[1<<20][2];
int need[20];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>M>>K;
	vector<int>vs;
	vs.reserve(20);
	for(int i=0;i<K;i++)
	{
		cin>>X[i]>>Y[i];
		vs.push_back(X[i]);
		vs.push_back(Y[i]);
	}
	sort(vs.begin(),vs.end());
	vs.erase(unique(vs.begin(),vs.end()),vs.end());
	assert(vs.size()<=20);
	if(vs.empty())
	{
		cout<<(C.P(N-1,M)*C.factorial(N-M)).val()<<endl;
		return 0;
	}
	for(int i=0;i<K;i++)
	{
		int u=lower_bound(vs.begin(),vs.end(),X[i])-vs.begin();
		int v=lower_bound(vs.begin(),vs.end(),Y[i])-vs.begin();
		need[v]|=1<<u;
	}
	for(int i=0;i<vs.size();i++)if(need[i]==0)dp[1<<i][vs[i]<=M]=1;
	for(int i=0;i<1<<vs.size();i++)for(int j=0;j<vs.size();j++)if(!(i>>j&1)&&(need[j]&i)==need[j])
	{
		dp[i|1<<j][0]+=dp[i][0];
		dp[i|1<<j][1]+=dp[i][1];
	}
	mint ans=C.C(N,vs.size())*C.factorial(N-vs.size())*(dp[(1<<vs.size())-1][0]+dp[(1<<vs.size())-1][1]);
	{//1
		ans-=C.C(N-1,vs.size()-1)*C.factorial(N-vs.size())*dp[(1<<vs.size())-1][1];
	}
	{
		int r=M;
		for(int v:vs)if(v<=M)r--;
		if(r>=1)
		{
			ans-=C.C(N-1,vs.size())*r*C.factorial(N-vs.size()-1)*(dp[(1<<vs.size())-1][0]+dp[(1<<vs.size())-1][1]);
		}
	}
	cout<<ans.val()<<endl;
}