#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int minRotation(string s) {
	int a=0, N=sz(s); s += s;
	rep(b,0,N) rep(k,0,N) {
		if (a+k == b || s[a+k] < s[b+k]) {b += max(0, k-1); break;}
		if (s[a+k] > s[b+k]) { a = b; break; }
	}
	return a;
}

void solve() {
	int n, m; cin >> n >> m;
	map<string, int> ss;
	map<int, int> pr;
	for (int i = 1; i <= n; i++) {
		string s; cin >> s;
		int k = minRotation(s);
		rotate(s.begin(), s.begin()+k, s.end());
		if (ss[s] == 0) {
			ss[s] = i;
			pr[i] = i;
		} else {
			pr[i] = ss[s];
		}
	}

	int q; cin >> q;
	while (q--) {
		int x, y; cin >> x >> y;
		if (pr[x] == pr[y]) {
			cout << "Yes\n";
		} else {
			cout << "No\n";
		}
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}