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

int n, m, a[5][N], b[5][N];
int p[18][N][5];

int main() {
	scanf("%d %d", &n, &m);
	for (int j = 0; j < m; j++) {
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[j][i]);
			b[j][a[j][i]] = i;
		}
	}
	memset(p[0], 0x3f, sizeof(p[0]));
	for (int u = 0; u < m; u++) for (int v = 0; v < m; v++) {
		int mn = n+1;
		for (int i = n; i; i--) {
			int x = a[u][i];
			mn = min(mn, b[v][x]);
			p[0][x][v] = min(p[0][x][v], mn);
		}
	}
	for (int l = 1; (1<<l) <= n; l++) {
		for (int i = 1; i <= n; i++) {
			for (int u = 0; u < m; u++) {
				p[l][i][u] = p[l-1][i][u];
				for (int v = 0; v < m; v++) {
					p[l][i][u] = min(p[l][i][u], p[l-1][a[v][p[l-1][i][v]]][u]);
				}
			}
		}
	}
	int Q; scanf("%d", &Q);
	while (Q--) {
		int x, y; scanf("%d %d", &x, &y);
		int t[5] = {0}, t2[5] = {0}, flg = 0;
		for (int u = 0; u < m; u++) {
			t[u] = b[u][x];
			if (t[u] < b[u][y]) { flg = 1; break; }
		}
		if (flg) { puts("1"); continue; }
		int ans = 2, ok = 0;
		for (int l = 17; ~l; l--) {
			memset(t2, 0x3f, sizeof(t2));
			for (int u = 0; u < m; u++) {
				t2[u] = t[u];
				for (int v = 0; v < m; v++) {
					t2[u] = min(t2[u], p[l][a[v][t[v]]][u]);
				}
			}
			flg = 0;
			for (int u = 0; u < m; u++) {
				if (t2[u] < b[u][y]) { flg = 1; break; }
			}
			if (!flg) memcpy(t, t2, sizeof(t)), ans += 1<<l;
			else ok = 1;
		}
		printf("%d\n", ok?ans:-1);
	}
	return 0;
}