#include<bits/stdc++.h>
using namespace std;
const int MAX=1E5+5;
int n,m,q;
int a[6][MAX],b[6][MAX];
int g[6][6][MAX],f[MAX][6][22],h[10],curh[10];
int main(){
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    cin>>n>>m;
    for(int i=1;i<=m;++i){
        for(int j=1;j<=n;++j){
            cin>>a[i][j];
            b[i][a[i][j]]=j;
        }
            
    }

    for(int i=1;i<=m;++i){
        for(int j=1;j<=m;++j){
            g[i][j][b[i][n]]=a[j][b[i][n]];
            for(int k=n-1;k>=1;--k){
                g[i][j][b[i][k]]=min(g[i][j][b[i][k+1]],a[j][b[i][k]]);
            }
        }
    }

    for(int i=1;i<=n;++i){
        for(int j=1;j<=m;++j){
            f[i][j][0]=1e9;
            for(int k=1;k<=m;++k){
                f[i][j][0]=min(f[i][j][0],g[k][j][i]);
            }
 //           cout<<i<<" "<<j<<" "<<f[i][j][0]<<"\n";
        }
    }

    for(int k=1;k<=20;++k){
        for(int i=1;i<=n;++i){
            for(int j=1;j<=m;++j){
                f[i][j][k]=f[i][j][k-1];
                for(int l=1;l<=m;++l){
                    f[i][j][k]=min(f[i][j][k],f[b[l][f[i][l][k-1]]][j][k-1]);
                }
            }
        }
    }

    cin>>q;
    while(q--){
        int x,y;
        cin>>x>>y;
        bool flag=0;
        for(int i=1;i<=m;++i){
            if(a[i][x]<a[i][y]){
                cout<<1<<"\n";
                flag=1;
                break;
            }
        }
        if(flag)
            continue;
        
        for(int i=1;i<=m;++i)
            h[i]=a[i][x];
        
        int res=0;
        for(int i=20;i>=0;--i){
            for(int j=1;j<=m;++j){
                curh[j]=h[j];
                for(int k=1;k<=m;++k){
                    curh[j]=min(curh[j],f[b[k][h[k]]][j][i]);
                }
            }
            bool flag=0;
            for(int j=1;j<=m;++j){
                if(curh[j]<a[j][y]){
                    flag=1;
                    break;
                }
            }
            if(!flag){
                for(int j=1;j<=m;++j){
                    h[j]=curh[j];                   
                }
                res+=(1<<i);
            }
        }
        if(res<(1<<21)-1)
            cout<<res+2<<"\n";
        else    
            cout<<-1<<"\n";
    }
}