#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

void solve(){
    int n, m;
    cin >> n >> m;

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

    vector<vector<vector<int>>> f(6, vector<vector<int>>(n + 1, vector<int>(21, n)));
    for(int i = 1; i <= m; i++){
        for(int j = 1; j <= n; j++){
            f[i][j][0] = pos[i][j];
        }
    }
    for(int i = 1; i <= m; i++){
        for(int k = 1; k <= m; k++){
            int minn = n;
            for(int j = n; j >= 1; j--){
                minn = min(minn, pos[i][a[k][j]]);
                f[i][j][0] = min(f[i][j][0], minn);
            }
        }
    }

    for(int k = 1; k <= 20; k++){
        for(int i = 1; i <= m; i++){
            for(int j = 1; j <= n; 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[i][a[l][f[l][j][k - 1]]][k - 1]);
                }
            }
        }
    }

    int q;
    cin >> q;
    while(q--){
        int x, y;
        cin >> x >> y;

        int L = 0;
        bool ok = false;

        vector<int> now(m + 1);
        for(int i = 1; i <= m; i++){
            now[i] = pos[i][x];
            if(f[i][x][20] <= pos[i][y]) ok = true;
            if(pos[i][x] < pos[i][y]) L = -1;
        }

        if(!ok){
            cout << "-1\n";
            continue;
        }

        for(int k = 20; k >= 0; k--){
            vector to(m + 1, n);
            bool flag = false;
            for(int i = 1; i <= m; i++){
                for(int l = 1; l <= m; l++){
                    to[i] = min(to[i], f[i][a[l][now[l]]][k]);
                    if(to[i] <= pos[i][y]) flag = true;
                    if(flag) break;
                }
                if(flag) break;
            }
            if(!flag){
                now = to;
                L += (1 << k);
            }
        }

        cout << L + 2 << "\n";
    }
    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    while(T--){
        solve();
    }
    return 0;
}