#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
using pi = pair <int, int> ; 
using ll = long long; 
mt19937_64 rnd(1);
cs int N = 1e5 + 5; 

int n, m; 
string A; 
int p[N], len[N], skip[N];

namespace SA {
cs int N = 2e6 + 5; 
int sa[N], tmp[N << 1], rk[N << 1], y[N], n, m; 
int st[21][N];
void Sort() {
    static int c[N];
    for(int i = 0; i <= m; i++) c[i] = 0; 
    for(int i = 1; i <= n; i++) c[rk[i]] ++;
    for(int i = 1; i <= m; i++) c[i] += c[i - 1];
    for(int i = n; i; i--) sa[c[rk[y[i]]]--] = y[i];
}
void work(string a) {  
    n = a.length(), m = 128; 
    for(int i = 1; i <= n; i++) 
        rk[i] = a[i - 1], y[i] = i;
    Sort();
    for(int k = 1; k <= n; k <<= 1) {
        int ret = 0; 
        for(int i = n - k + 1; i <= n; i++) y[++ ret] = i; 
        for(int i = 1; i <= n; i++) if(sa[i] > k) y[++ ret] = sa[i] - k; 
        Sort();
        swap(rk, tmp);
        rk[sa[1]] = 1; 
        int num = 1; 
        for(int i = 2; i <= n; i++) {
            if(tmp[sa[i]] == tmp[sa[i - 1]] && tmp[sa[i] + k] == tmp[sa[i - 1] + k]) 
                rk[sa[i]] = num;
            else 
                rk[sa[i]] = ++ num;
        }
        if(num == n) break;
        m = num; 
    }
    
    int k = 0;
    for(int i = 1;i <= n; i++) {
        if(rk[i] == 1) continue; 
        int j = sa[rk[i] - 1]; if(k) k--;
        while(i + k <= n && j + k <= n && a[i + k - 1] == a[j + k - 1]) k++;
        st[0][rk[i]] = k; 
    }
    for(int i = 1; i < 21; i++)
    for(int j = 1; j + (1 << i) - 1 <= n; j++)
    st[i][j] = min(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
int lcp(int x, int y) {
    if(x == y) return 1e6; 
    x = rk[x], y = rk[y];
    if(x > y) swap(x, y); ++ x; 
    int z = __lg(y - x + 1);
    return min(st[z][x], st[z][y - (1 << z) + 1]);
}
}
int check(int a, int b) {
    int l = SA :: lcp(p[a], p[b]);
    if(l < len[a] && l < len[b]) return SA :: rk[p[a]] < SA :: rk[p[b]];
    return len[a] < len[b] || (len[a] == len[b] && a < b);
}
vector <string> aa, bb; 
int check2(int a, int b, int s, int f) {
    // string c = aa[a] + bb[s];
    // string d = aa[s] + bb[f];
    // return c < d || (c == d && a < s);
    if(a == s) return check(b, f);
    
    bool o = (len[a] + len[b] < len[s] + len[f]) 
        || (len[a] + len[b] == len[s] + len[f] && a < s);
    int l = SA :: lcp(p[a], p[s]);
    
    if(l < len[a] && l < len[s]) 
        return SA :: rk[p[a]] < SA :: rk[p[s]];


    if(len[a] + len[b] <= len[s]) {
        int res = len[s] - len[a];
        l = SA :: lcp (p[s] + len[a], p[b]);
        if(l < len[b] && l < res) return SA :: rk[p[b]] < SA :: rk[p[s] + len[a]];
        return 1; 
    }

    if(len[s] + len[f] <= len[a]) {
        int res = len[a] - len[s];
        l = SA :: lcp(p[a] + len[s], p[f]);
        if(l < res && l < len[f]) return SA :: rk[p[a] + len[s]] < SA :: rk[p[f]];
        return 0; 
    }

    
    if(len[a] < len[s]) {
        int res = len[s] - len[a];
        l = SA :: lcp(p[s] + len[a], p[b]);
        if(l < res && l < len[b]) return SA :: rk[p[b]] < SA :: rk[p[s] + len[a]];

        l = SA :: lcp(p[b] + res, p[f]);
        if(l < len[b] - res && l < len[f]) return SA :: rk[p[b] + res] < SA :: rk[p[f]];
        return o;
    }
    // len[a] >= len[s] 
    
    int res = len[a] - len[s];
    l = SA :: lcp(p[a] + len[s], p[f]);
    if(l < res && l < len[f]) return SA :: rk[p[a] + len[s]] < SA :: rk[p[f]];
    l = SA :: lcp(p[b], p[f] + res);
    if(l < len[f] - res && l < len[b]) return SA :: rk[p[b]] < SA :: rk[p[f] + res];
    return o;
}

ll calc(int s, int f, vector <int> & l, vector <int> & r, cs vector <int> & pl, cs vector <int> & pr, ll & k) {
    vector <int> mid(n + 1);
    ll ans = 0; 
    assert(1 <= s && s <= n);
    assert(1 <= f && f <= m);
    for(int i = 1;i <= n; i++) 
    if(l[i] <= r[i]) {
        if(i == s) {
            mid[i] = f; 
            continue; 
        }
        int L = l[i], R = r[i];
        if(check2(pl[i], pr[R] + n, pl[s], pr[f] + n)) {
            mid[i] = R; 
            continue; 
        }
        while(L < R) {
            int mi = (L + R + 1) >> 1;
            if(check2(pl[i], pr[mi] + n, pl[s], pr[f] + n)) {
                L = mi; 
            }
            else {
                R = mi - 1; 
            }
        }
        if(check2(pl[i], pr[L] + n, pl[s], pr[f] + n)) mid[i] = L; 
        else mid[i] = L - 1; 
    }
    for(int i = 1; i <= n; i++)
        if(l[i] <= r[i]) ans += mid[i] - l[i] + 1; 
    if(ans <= k) {
        k -= ans; 
        for(int i = 1; i <= n; i++)
            if(l[i] <= r[i]) l[i] = mid[i] + 1;
    }
    else {
        for(int i = 1; i <= n; i++)
            if(l[i] <= r[i]) r[i] = mid[i]; 
    }
    for(int i = 1; i <= n; i++) {
        assert(l[i] <= r[i] || r[i] == l[i] - 1);
    }
    return ans; 
}

int main() {
    #ifdef zqj
    freopen("3.in","r",stdin);
    #endif
    ios::sync_with_stdio(false),cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        string a;
        cin >> a; 
        int l = a.length();
        len[i] = l;
        A += a; 
    }
    p[0] = 1; 
    for(int i = 1; i <= n; i++) 
        p[i] = p[i - 1] + len[i - 1];
    for(int i = 1; i <= m; i++) {
        string b; 
        cin >> b; 
        int l = b.length();
        len[i + n] = l; 
        A += b; 
    }
    for(int i = n + 1; i <= n + m; i++) 
        p[i] = p[i - 1] + len[i - 1];
    SA :: work(A);

    
    vector <int> pl(n + 1), pr(m + 1);
    for(int i = 1; i <= n; i++) pl[i] = i;
    for(int i = 1; i <= m; i++) pr[i] = i;
    sort(pl.begin() + 1, pl.end(), 
    [](cs int & x, cs int & y) {
        return check(x, y);
    });
    sort(pr.begin() + 1, pr.end(),
    [](cs int & x, cs int & y) {
        return check(x + n, y + n);
    });

    int q; 
    cin >> q; 
    for(int T = 0; T < q; T++) {
        vector <int> l(n + 1), r(n + 1);
        for(int i = 1; i <= n; i++) r[i] = m, l[i] = 1; 
        ll k; 
        cin >> k; 
        int anss = 0, ansf = 0; 
        while(1) {
            ll siz = 0;
            for(int i = 1; i <= n; i++)
                if(l[i] <= r[i]) siz += r[i] - l[i] + 1; 
            ll t = rnd() % siz + 1; 
            int s = 0, f = 0; 
            for(int i = 1; i <= n; i++) if(l[i] <= r[i]) {
                if(t <= r[i] - l[i] + 1) {
                    s = i, f = l[i] + t - 1; 
                    break;
                }
                t -= r[i] - l[i] + 1; 
            }
            anss = pl[s], ansf = pr[f]; 
            if(siz == 1) {
                break;
            }
            ll num = calc(s, f, l, r, pl, pr, k);
            // cout << k << ' ' << num << ' ' << pl[s] << ' ' << pr[f] <<endl;
            if(k == 0) break;
        }
        cout << anss << ' ' << ansf << '\n';
        // cout<<aa[anss]<<endl<<bb[ansf]<<endl<<aa[anss]<<endl<<bb[19018]<<endl;
    }
    return 0; 
}