/*
    Name:
    Copyright:
    Author: 不要和 std 命名空间冲突！
    Date: 11/14/2023 9:45:41 AM
    Description:等会造成误差！文件读写即可！
*/
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b)  for (int i = (a); i <= (b); i++)
#define repe(i,a,b) for (int i = (a); i >= (b); i--)
bool Mbe;
inline int read() {
	int ans = 0, f = 1; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) if (ch == '-') f = -f;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) ans = (ans << 3) + (ans << 1) + ch - '0';
	return ans * f;
}
const int mod = 1e9 + 7;
int ksm(int truth, int power) {
	int ans = 1;
	while(power) {
		if(power & 1) ans = 1ll * ans * truth % mod;
		power >>= 1;
		truth = 1ll * truth * truth % mod;
	}
	return ans;
}

const int Z = 2e6 + 5;
int fac[Z], ifac[Z];
void init_fac(int x) {
	for(int i = fac[0] = 1; i <= x; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
	ifac[x] = ksm(fac[x], mod - 2);
	for(int i = x - 1; i >= 0; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % mod;
}

int C(int mu, int zi) {
	return fac[mu] * 1ll * ifac[zi] % mod * ifac[mu - zi] % mod;
}

const int N = 2e3 + 23;
int  n, k, m, f[N];
bool vis[N];
struct node {
	int x, y;
//	bool operator < ( node B) {
//		if(x == B.x) return y < B.y;
//		return x < B.x;
//	} 
}a[N];
bool cmp(node A, node B) {
	if(A.x == B.x) return A.y < B.y;
	return A.x < B.x;
} 

void mian() {
	n = read(), m = read(), k = read();
	rep(i,1,k) a[i].x = read(), a[i].y = read();
	sort(a + 1, a + k + 1, cmp);
//	rep(i,1,k) cout << a[i].x << " " << a[i].y << endl;
	init_fac(n + m);
	a[0].x = 0, a[0].y = 0; a[k + 1].x = n, a[k + 1].y = m;
	rep(i,1,k + 1) {
		f[i] = C(a[i].x + a[i].y - 2, a[i].x - 1);
		rep(j,1,i - 1) {
			if(a[j].x <= a[i].x && a[j].y <= a[i].y) { // 一边等于 
				f[i] = (f[i] - 1ll * f[j] * C(a[i].y + a[i].x - a[j].y - a[j].x, a[i].x - a[j].x) % mod + mod) % mod; 
			}
		}
	} 
	cout << f[k + 1] << "\n";
}

bool Med;
int main(){
//    freopen("B.txt", "r", stdin);
//    freopen(".out", "w", stdout);
	fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0);
	int T = read();
	while(T--) mian();
	cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
	return 0;
}