#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1000000007;
int qp(int p,int q){
	int ans = 1,pro = p;
	while(q){
		if(q&1)ans = ans*pro%mod;pro = pro*pro%mod;q>>=1;
	}return ans;
}
int niyuan(int x){
	return qp(x,mod-2);
}
int n,m,k;
int dp[5005];
int jie[500005],inv[500005];
pair<int,int>a[5005];int x[5005],y[5005];
int C(int n,int m){
	if(n<m)return 0;
	return jie[n]*inv[m]%mod*inv[n-m]%mod;
}
bool cmp(pair<int,int>a,pair<int,int>b){
	if(a.second == b.second)return a.first<b.first;
	return a.second<b.second;
}void solve(){
	cin >> n >> m >> k;;
	for(int i = 1;i<=k;i++)cin >> a[i].first >> a[i].second;
	a[k+1].first = n,a[++k].second = m;
	for(int i =0;i<=k;i++)dp[i] = 0;
	sort(a+1,a+1+k,cmp);dp[0] = 1;
	for(int i = 1;i<=k;i++)x[i] = a[i].first,y[i] = a[i].second;
	for(int i= 1;i<=k;i++){
		dp[i] = C(x[i]+y[i]-2,x[i]-1);
		for(int j = 1;j<i;j++){
			if(x[i]>=x[j] and y[i]>=y[j]){
				dp[i]-=C(x[i]-x[j]+y[i]-y[j],x[i]-x[j])*dp[j]%mod;
			}
		}dp[i] = (dp[i]%mod+mod)%mod;
	}cout << dp[k] << endl;
}
signed main(){
	
	jie[0] = inv[0] = 1;
	for(int i = 1;i<=500000;i++)jie[i] = jie[i-1]*i%mod;inv[500000] = niyuan(jie[500000]);
	for(int i = 499999;i>=1;i--)inv[i] = inv[i+1]*(i+1)%mod;
	int t;cin >> t;
	while(t--){
		solve();
	}
	return 0;
}