#include <cstdio>
#include <algorithm>
struct pr {
	long long a, b, c;
	bool operator < (const pr &rhs) const {
		if (a != rhs.a) return a < rhs.a;
		if (b != rhs.b) return b < rhs.b;
		return c < rhs.c;
	}
}c[5000010];
int T, n, m, q;
int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &n, &q);
		m = 0;
		for (int i = 1; i <= n; ++i) {
			long long a, b;
			scanf("%lld%lld", &a, &b);
			while (a && b) {
				if (a >= b) {
					c[++m] = {a % b, b, a / b};
					a %= b;
				} else {
					c[++m] = {a, b % a, b / a};
					b %= a;
				}
			}
		}
		std::sort(c + 1, c + m + 1);
		for (int i = 1; i <= q; ++i) {
			long long a, b;
			scanf("%lld%lld", &a, &b);
			int ans = 0;
			if (a >= b) {
				pr P = {a % b, b, a / b};
				pr *pos = std::lower_bound(c + 1, c + m + 1, P);
				P.c = 2e18;
				ans = std::lower_bound(c + 1, c + m + 1, P) - pos;
			}
			if (b >= a) {
				pr P = {a, b % a, b / a};
				pr *pos = std::lower_bound(c + 1, c + m + 1, P);
				P.c = 2e18;
				ans += std::lower_bound(c + 1, c + m + 1, P) - pos;
			}
			printf("%d\n", ans);
		}
	}
}