#include <bits/stdc++.h>

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n, m; std::cin >> n >> m;
	std::vector a(m, std::vector<int>(n)), rk(m, std::vector<int>(n));
	for(int i = 0; i < m; i++)
		for(int j = 0; j < n; j++)
			std::cin >> a[i][j], a[i][j]--;

	for(int i = 0; i < m; i++)
		for(int j = 0; j < n; j++)
			rk[i][a[i][j]] = j;

	int log = std::__lg(n) + 1;
	std::vector f(n, std::vector(log + 1, std::vector<int>(m, n)));

	for(int x = 0; x < m; x++)
	{
		for(int y = 0; y < m; y++) // x -> y
		{
			std::vector<int> min(n);
			min[n - 1] = rk[y][a[x][n - 1]];
			for(int i = n - 2; i >= 0; i--)
				min[i] = std::min(min[i + 1], rk[y][a[x][i]]);

			for(int i = 0; i < n - 1; i++) f[a[x][i]][0][y] = std::min(f[a[x][i]][0][y], min[i + 1]);
		}
	}

	for(int j = 1; j <= log; j++)
		for(int i = 0; i < n; i++)
			for(int x = 0; x < m; x++)
				for(int y = 0; y < m; y++)
					f[i][j][x] = std::min({f[i][j][x], f[i][j - 1][x], f[a[y][f[i][j - 1][y]]][j - 1][x]});

	int q; std::cin >> q;
	while(q--)
	{
		int x, y; std::cin >> x >> y;
		x--, y--;

		bool ok = false;
		for(int i = 0; i < m; i++)
			if(rk[i][x] < rk[i][y])
				ok = true;

		if(ok)
		{
			std::cout << 1 << "\n";
			continue;
		}

		std::vector<int> cur(m);
		for(int i = 0; i < m; i++) cur[i] = rk[i][x];
		int ans = 0;
		for(int i = log; i >= 0; i--)
		{
			auto tmp = cur;
			for(int j = 0; j < m; j++)
				for(int k = 0; k < m; k++)
					tmp[k] = std::min(f[a[j][cur[j]]][i][k], tmp[k]);

			bool flg = true;
			for(int j = 0; j < m; j++)
				if(tmp[j] <= rk[j][y]) flg = false;

			if(flg)
			{
				ans |= 1 << i;
				cur = tmp;
			}
		}

		if(ans == (1 << (log + 1)) - 1) std::cout << -1 << "\n";
		else std::cout << ans + 2 << "\n";
	}

	return 0;
}