#include<bits/stdc++.h>
#include<chrono>


std::string numToStr(int num) {
    std::string res;
    while (num) {
        res += " \t"[num % 2];
        num /= 2;
    }
    return res;
}



using namespace std;
using pii = pair < int, int > ;
int n, m, q, ed[2000005], sl[2000005];
int tot = 1, lst = 1, fa[200005], len[200005], ch[200005][26];
int pa[200005][18], rt[200005];
string s, t;
vector < int > e[200005];
void extend(int c) {
   int p = lst, cur = lst = ++tot;
   len[cur] = len[p] + 1;
   while (p && !ch[p][c]) ch[p][c] = cur, p = fa[p];
   if (!p) return fa[cur] = 1, void();
   int q = ch[p][c];
   if (len[q] == len[p] + 1) return fa[cur] = q, void();
   int nq = ++tot;
   fa[nq] = fa[q];
   len[nq] = len[p] + 1;
   for (int i = 0; i <= 25; i++) ch[nq][i] = ch[q][i];
   fa[q] = fa[cur] = nq;
   while (p && ch[p][c] == q) ch[p][c] = nq, p = fa[p];
}
struct segtree {
   int tot, ls[3200005], rs[3200005];
   pii t[3200005];
   pii pup(pii x, pii y) {
      pii res;
      res.first = max(x.first, y.first);
      res.second = x.first == res.first ? x.second : y.second;
      return res;
   }
   void pushup(int now) {
      t[now] = pup(t[ls[now]], t[rs[now]]);
   }
   void modify(int p, int l, int r, int & now) {
      if (!now) now = ++tot;
      if (l == r) return t[now].first++, t[now].second = l, void();
      int mid = (l + r) >> 1;
      if (p <= mid) modify(p, l, mid, ls[now]);
      else modify(p, mid + 1, r, rs[now]);
      pushup(now);
   }
   int merge(int x, int y, int l, int r) {
      if (!x || !y) return x | y;
      int z = ++tot;
      if (l == r) {
         t[z] = {t[x].first + t[y].first, l};
         return z;
      }
      int mid = (l + r) >> 1;
      ls[z] = merge(ls[x], ls[y], l, mid);
      rs[z] = merge(rs[x], rs[y], mid + 1, r);
      return pushup(z), z;
   }
   pii query(int x, int y, int l, int r, int now) {
      if (!now) return {0, 0};
      if (x <= l && r <= y) return t[now];
      int mid = (l + r) >> 1;
      pii ans = {0, 0};
      if (x <= mid) ans = pup(ans, query(x, y, l, mid, ls[now]));
      if (y > mid) ans = pup(ans, query(x, y, mid + 1, r, rs[now]));
      return ans;
   }
}
sgt;
void dfs(int now) {
   pa[now][0] = fa[now];
   for (int i = 1; i <= 17; i++) pa[now][i] = pa[pa[now][i - 1]][i - 1];
   for (int to: e[now]) {
      dfs(to);
      rt[now] = sgt.merge(rt[now], rt[to], 1, m);
   }
}
void Solve() {
   cin >> s >> m;
   s = ' ' + s;
   n = s.size() - 1;
   for (int i = 1; i <= m; i++) {
      cin >> t;
      t = ' ' + t;
      int len = t.size() - 1;
      lst = 1;
      for (int j = 1; j <= len; j++) extend(t[j] - 'a'), sgt.modify(i, 1, m, rt[lst]);
   }
   int np = 1, nl = 0;
   for (int i = 1; i <= n; i++) {
      if (ch[np][s[i] - 'a']) np = ch[np][s[i] - 'a'], nl++;
      else {
         while (np != 1 && !ch[np][s[i] - 'a']) np = fa[np], nl = len[np];
         if (ch[np][s[i] - 'a']) np = ch[np][s[i] - 'a'], nl++;
      }
      ed[i] = np;
      sl[i] = nl;
   }
   for (int i = 2; i <= tot; i++) e[fa[i]].push_back(i);
   dfs(1);
   vector<pair<int,int>> answer;
   cin >> q;
   int _l[q],_r[q],_pl[q],_pr[q];
	auto start = chrono::high_resolution_clock::now();
   for(int i=0;i<q;++i) cin >> _l[i] >> _r[i] >> _pl[i] >> _pr[i];
   cout << numToStr(chrono::duration_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()-start).count());
   for(int i=0;i<q;++i) {
      int l=_l[i], r=_r[i], pl=_pl[i], pr=_pr[i], p;
      p = ed[pr];
      if (sl[pr] < pr - pl + 1) {
      	answer.push_back({l,0});
         continue;
      }
      for (int i = 17; i >= 0; i--)
         if (len[pa[p][i]] >= pr - pl + 1) p = pa[p][i];
      auto res = sgt.query(l, r, 1, m, rt[p]);
      if (!res.first) answer.push_back({l,0});
      else answer.push_back({res.second,res.first});
   }
   for(auto i:answer)
   	cout << i.first << ' ' << i.second << endl;
}
signed main() {
   cin.tie(0) -> sync_with_stdio(0);
   int T = 1;
   while (T--) Solve();
   return 0;
}