#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
//基础配置=================================================================================
const ll N = 100005 , M = 6;
ll n,m,ans=0,x,y,l,r,s,z;
ll a[N];
ll b[M][N];
ll pos[M][N];
struct infor{
    ll t[M];
};
infor f[21][N];
void solve(ll id){
    // printf("\n\n\nsolve : %lld\n",id);
    ll i,j;
    ll to[M][N];
    fr(i,1,m)
        fr(j,1,n) to[i][j] = pos[id][j];
    fr(i,1,m)
        rfr(j,n-1,1) Min(to[i][j],to[i][j+1]);
    // to[n] = pos[id][n];
    // rfr(i,n-1,1)
        // to[i] = min(pos[id][i],to[i+1]);
    // fr(i,1,n) printf("to[%lld] = %lld\n",i,to[i]);
    fr(i,1,n){
        ll v = inf;
        fr(j,1,m){
            ll x = to[j][pos[j][i]];
            Min(v,x);
        }
        // printf("v = %lld\n",v);
        f[0][i].t[id] = b[id][v];
    }
}
ll calc(ll x,ll y){
    if (x==y) return 0;
    ll i,j,p;
    ll Lm = inf;
    ll t[M],tt[M];
    fr(i,1,m) t[i] = x;
    fr(i,1,m)
        if (pos[i][t[i]]<=pos[i][y]) return 1;
    ll k;
    for (k=0; (1<<k)<=n; k++); k--;
    ll ans = 0;
    rfr(i,k,0){
        // printf("\n i = %lld\n",i);
        fr(j,1,m) tt[j] = t[j];
        fr(j,1,m){
            ll x = t[j];
            fr(p,1,m){
                ll y = f[i][x].t[p];
                if (pos[p][y]<=pos[p][tt[p]]) tt[p] = y;
            }
        }
        // fr(j,1,m) printf("tt[%lld] = %lld\n",j,tt[j]);
        bool flag = false;
        fr(j,1,m)
            if (pos[j][tt[j]]<=pos[j][y]) flag = true;
        fr(j,1,m)
            if (pos[j][tt[j]]==pos[j][y]) Min( Lm , ans+(1<<i) );
        if (!flag){
            fr(j,1,m) t[j] = tt[j];
            ans |= 1<<i;
        }
        // printf("ans = %lld\n",ans);
        // fr(j,1,m) printf("t[%lld] = %lld\n",j,t[j]);
    }
    if (ans>n) return -1;
    return min(Lm,ans+2);
}
int main(){
	// freopen("a.in","r",stdin);
//	freopen(".out","w",stdout);
    ll i,j,k,p;
    read(n); read(m);
    fr(i,1,m)
        fr(j,1,n) read(b[i][j]);
    fr(i,1,m)
        fr(j,1,n) pos[i][b[i][j]] = j;
    fr(i,1,m) solve(i);
    // fr(i,1,n){
    //     printf("f[0][%lld] : ",i);
    //     fr(j,1,m) printf("%lld ",f[0][i].t[j]);
    //     putchar('\n');
    // }
    for (i=1; (1<<i)<=n; i++){
        fr(j,1,n) f[i][j] = f[i-1][j];
        fr(j,1,n){
            bool flag = false;
            if (i==1 && j==4) flag = true;
            fr(k,1,m){
                ll x = f[i-1][j].t[k];
                // printf("\nk = %lld , x = %lld\n",k,x);
                fr(p,1,m){
                    y = f[i-1][x].t[p];
                    if (pos[p][y]<=pos[p][f[i][j].t[p]]) f[i][j].t[p] = y;
                }
            }
        }
    }
    // fr(i,0,2){
    //     printf("\ni = %lld\n",i);
    //     fr(j,1,n){
    //         printf("f[%lld] : ",j);
    //         fr(k,1,m) printf("%lld ",f[i][j].t[k]);
    //         putchar('\n');
    //     }
    // }
    ll qt;
    read(qt);
    while (qt--){
        read(x); read(y);
        ll ans = calc(x,y);
        write(ans); putchar('\n');
    }
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000