//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mid ((l+r)>>1)
#define lowbit(x) (x&-x)
#define all(x) (x).begin(),(x).end()
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=1e5+10;
int n,m,q,a[10][N],dp1[20],dp2[20],nxt[N][10][20],rk[10][N];
inline void solve(){
	cin>>n>>m;
	memset(nxt,0x3f,sizeof(nxt));
	rep(i,1,m) rep(j,1,n)
		cin>>a[i][j],rk[i][a[i][j]]=j;
	rep(i,1,n) rep(p,1,m) rep(j,1,m){
		int k=1e18;
		rep(s,rk[p][i],n) k=min(k,rk[j][a[p][s]]);
		nxt[i][j][0]=min(nxt[i][j][0],k);
	}
	//nxt[i][j][k] i 开始，跳到序列 j，用了 2^k 步的最小排名
	rep(j,1,19) rep(p,1,m) rep(i,1,n) rep(la,1,m)
		nxt[i][p][j]=min(nxt[i][p][j],nxt[a[la][nxt[i][la][j-1]]][p][j-1]);
	// rep(i,1,n) rep(j,1,m) rep(k,0,19)
		// if (nxt[i][j][k]<(1e17))
			// cerr<<i<<' '<<j<<' '<<k<<' '<<nxt[i][j][k]<<" wenhao?\n";
	cin>>q;
	while (q--){
		int x,y,ans=0;cin>>x>>y;
		rep(i,1,m) dp1[i]=rk[i][x];
		rep(i,1,m)
			if (rk[i][x]<=rk[i][y]){ans=1;break;}
		if (ans==1){cout<<"1\n";continue;}
		per(p,19,0){
			rep(i,1,m) dp2[i]=dp1[i];
			rep(i,1,m) rep(j,1,m)
				dp2[j]=min(dp2[j],nxt[a[i][dp1[i]]][j][p]);
			int tag=0;
			rep(i,1,m)
				if (dp2[i]<=rk[i][y]){tag=1;break;}
			if (!tag){
				ans+=1<<p;
				rep(i,1,m) dp1[i]=dp2[i];
			}
		}
		if (ans==(1<<20)-1) cout<<"-1\n";
		else cout<<ans+2<<'\n';
	}
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	// cin>>t;
	while (t--) solve();
	cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
	return 0;
}