#include<bits/stdc++.h>
using namespace std;
#define ri int
typedef long long ll;
const int maxn=33,mod=59393;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
template<class T>inline void clear(T *arr,int siz,int val=0){memset(arr,val,sizeof(T)*(siz+1));}
struct modint{
	int val;
	inline modint(int val_=0):val(val_){}
	inline modint &operator=(int val_){return val=val_,*this;}
	inline modint &operator+=(const modint &k){return val=val+k.val>=mod?val+k.val-mod:val+k.val,*this;}
	inline modint &operator-=(const modint &k){return val=val-k.val<0?val-k.val+mod:val-k.val,*this;}
	inline modint &operator*=(const modint &k){return val=1ll*val*k.val%mod,*this;}
	inline modint &operator^=(int k){
	    modint ret=1,tmp=*this;
	    for(;k;k>>=1,tmp*=tmp)if(k&1)ret*=tmp;
	    return val=ret.val,*this;
	}
	inline modint &operator/=(modint k){return *this*=(k^=mod-2);}
	inline modint &operator+=(int k){return val=val+k>=mod?val+k-mod:val+k,*this;}
	inline modint &operator-=(int k){return val=val<k?val-k+mod:val-k,*this;}
	inline modint &operator*=(int k){return val=1ll*val*k%mod,*this;}
	inline modint &operator/=(int k){return *this*=((modint(k))^=mod-2);}
	template<class T>friend modint operator+(modint a,T b){return a+=b;}
	template<class T>friend modint operator-(modint a,T b){return a-=b;}
	template<class T>friend modint operator*(modint a,T b){return a*=b;}
	template<class T>friend modint operator^(modint a,T b){return a/=b;}
	template<class T>friend modint operator/(modint a,T b){return a/=b;}
	friend modint operator^(modint a,int b){return a^=b;}
	friend bool operator==(modint a,int b){return a.val==b;}
	friend bool operator!=(modint a,int b){return a.val!=b;}
	inline bool operator!(){return !val;}
	inline modint operator-(){return val?mod-val:0;}
	inline modint &operator++(){return *this+=1;}
};
using mi=modint;
mi fac[mod],ifac[mod];
inline void init(){
	fac[0]=1;
	for(ri i=1;i<mod;++i)fac[i]=fac[i-1]*i;
	ifac[mod-1]=1/fac[mod-1];
	for(ri i=mod-1;i;--i)ifac[i-1]=ifac[i]*i;
}
inline mi C(int x,int y){
	if(x<y||y<0)return 0;
	return fac[x]*ifac[y]*ifac[x-y];
}
inline mi lucas(int x,int y){
	if(!y)return 1;
	return C(x%mod,y%mod)*lucas(x/mod,y/mod);
}
inline mi calc(int x,int y){
	if(x<0||y<0)return 0;
	mi ret=0;
	for(ri i=min(x,y);~i;--i)ret+=lucas(x+y-i,i)*lucas(x+y-(i<<1),x-i);
	return ret;
}
mi ans,f[maxn][maxn];
int k,m,n;
int main(){
	init();
	scanf("%d%d%d",&n,&m,&k);
	typedef pair<int,int> pii;
	#define fi first
	#define se second
	vector<pii>p(k+2);
	p[0]={1,1};
	for(ri i=1;i<=k;++i)scanf("%d%d",&p[i].fi,&p[i].se);
	p[++k]={n+1,m+1};
	sort(p.begin(),p.end());
	for(ri i=0;i<k;++i)
		for(ri j=i+1;j<=k;++j)
			f[i][j]=calc(p[j].fi-p[i].fi,p[j].se-p[i].se);
	for(ri i=1<<k-1;i<1<<k;++i){
		ri cur=0;
		mi sum=1;
		for(ri j=1;j<k;++j)
			if(i&(1<<j-1))
				sum*=f[cur][j],cur=j;
		sum*=f[cur][k];
		ans+=(__builtin_parity(i)?1:mod-1)*sum;
	}
	printf("%d",ans);
	return 0;
}