#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 100010;
int n, m, q;
struct node{
    int a[10];
    node() {memset(a, 0x3f, sizeof(a));}
    int& operator [] (const int& x) {return a[x];}
    int operator [] (const int& x) const {return a[x];}
    bool operator > (const node& x) const{
        rep(i, 1, m) if(a[i] <= x[i]) return 0;
        return 1;
    }
} rnk[N], f[N][17];
int a[10][N];

int main(){
    scanf("%d%d", &n, &m);
    rep(i, 1, m) rep(j, 1, n){
        scanf("%d", &a[i][j]);
        rnk[a[i][j]][i] = j;
    }
    rep(i, 1, m){
        node mn;
        per(j, n, 1){
            rep(k, 1, m) mn[k] = min(mn[k], rnk[a[i][j]][k]);
            rep(k, 1, m) f[j][0][k] = min(f[j][0][k], mn[k]);
        }
    }
    rep(k, 1, 16) rep(i, 1, n) rep(j, 1, m) rep(l, 1, m){
        f[i][k][j] = min(f[i][k][j], f[a[l][f[i][k-1][l]]][k-1][j]);
    }
    // printf("%d\n", f[6][1][1]);
    scanf("%d", &q);
    while(q--){
        int x, y; scanf("%d%d", &x, &y);
        if(!(rnk[x] > rnk[y])) {puts("1"); continue;}
        int ans = 0; node nw = rnk[x];
        per(i, 16, 0){
            node nxt;
            rep(j, 1, m) rep(k, 1, m)
                nxt[k] = min(nxt[k], f[a[j][nw[j]]][i][k]);
            if(nxt > rnk[y]) nw = nxt, ans += 1 << i;
        }
        if(ans > n) {puts("-1"); continue;}
        printf("%d\n", ans + 2);
    }
    return 0;
}