#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=2e5+9,B=10;
ll n,q,m,a[B][N],rk[B][N],nxt[20][B][N],go[B][B][N],f[B],g[B];
//nxt[i][j][k]: starting from k, jump 2^j steps, the best rank of contest i
bool chk(ll x,ll y){
	rep(i,1,m){
		if(a[i][x]>a[i][y])return 1;
	}
	return 0;
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read(),m=read();
	rep(i,1,m){
		rep(j,1,n)a[i][j]=read(),rk[i][a[i][j]]=j;
	}
	rep(i,1,m){
		rep(j,1,m){
			rep(k,1,n)go[i][j][k]=max(go[i][j][k-1],rk[j][a[i][k]]);
		}
	}
	rep(i,1,n){
		rep(j,1,m){
			rep(k,1,m)nxt[0][j][i]=max(nxt[0][j][i],go[k][j][rk[k][i]-1]);
		}
	}
	rep(p,1,17){
		rep(i,1,m){
			rep(j,1,n){
				nxt[p][i][j]=nxt[p-1][i][j];
				rep(k,1,m)nxt[p][i][j]=max(nxt[p][i][j],nxt[p-1][i][a[k][nxt[p-1][j][k]]]);
			}
		}
	}
	q=read();
	while(q--){
		ll y=read(),x=read();
		if(chk(x,y)){
			puts("1");
			continue;
		}
		ll ans=0;
		rep(i,1,m)f[i]=rk[i][x];
		per(i,17,0){
			memset(g,0,sizeof(g));
			rep(j,1,m){
				rep(k,1,m)g[j]=max(g[j],nxt[i][j][a[k][f[k]]]);
			}
			ll fl=0;
			rep(j,1,m){
				if(chk(a[j][g[j]],y)){
					fl=1;
					break;
				}
			}
			if(!fl){
				ans|=(1<<i);
				rep(j,1,m)f[j]=g[j];
			}
		}
		if(ans>n)puts("-1");
		else write(ans+2),putchar('\n');
	}
	return 0;
}