#include <bits/stdc++.h>
#define ll long long
using namespace std;
int t, n, m, k;
const ll mod = 1000000007;
ll jie[1000016], inv[1000016], f[2005];
inline ll ksm(ll p, ll q = mod - 2) {
	ll base = 1;
	while (q) {
		if (q & 1) base = base * p % mod;
		q >>= 1;
		p = p * p % mod;
	}
	return base;
}
inline ll C(int p, int q) {
	return jie[p] * inv[q] % mod * inv[p - q] % mod;
}
inline ll get_ans(int p, int q) { // p行 q 列网格图 方案数
	return C(q + p - 2, p - 1);
}
struct node {
	int x, y;
} b[2005];
bool cmp(node p, node q) {
	return (p.x == q.x) ? (p.y < q.y) : (p.x < q.x);
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	jie[0] = 1;
	for (int i = 1; i <= 1000005; i++) {
		jie[i] = jie[i - 1] * i % mod;
	}
	inv[1000005] = ksm(jie[1000005]);
	for (int i = 1000004; i >= 0; i--) {
		inv[i] = inv[i + 1] * (i + 1) % mod;
	}
	cin >> t;
	while (t--) {
		cin >> n >> m >> k;
		for (int i = 1; i <= k; i++) {
			cin >> b[i].x >> b[i].y;
		}
		b[++k] = node{n, m};
		sort(b + 1, b + k + 1, cmp);
		for (int i = 1; i <= k; i++) {
			f[i] = get_ans(b[i].x, b[i].y);
			for (int j = 1; j < i; j++) {
				if (b[j].x <= b[i].x && b[j].y <= b[i].y) {
					f[i] = (f[i] + mod - f[j] * get_ans(b[i].x - b[j].x + 1, b[i].y - b[j].y + 1) % mod) % mod;
				}
			}
		}
		cout << f[k] << "\n";
	}
}