#include <bits/stdc++.h>
#define ll long long
#define enl putchar('\n')
#define all(x) (x).begin(),(x).end()
#define debug(x) printf(" "#x":%d\n",x);
using namespace std;
const int MAXN = 2e5 + 5, LOG = 19;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;
typedef pair<int, int> pii;
char buf[1 << 21], * p1 = buf, * p2 = buf, obuf[1 << 21], * o = obuf, of[35];
#define gc()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
inline ll qpow(ll a, ll n) { ll res = 1; while (n) { if (n & 1)res = res * a % mod; n >>= 1; a = a * a % mod; }return res; }
template <class T = int>inline T read() { T s = 0, f = 1; char c = gc(); for (; !isdigit(c); c = gc())if (c == '-')f = -1; for (; isdigit(c); c = gc())s = s * 10 + c - '0'; return s * f; }
inline void read(int* a, int n) { for (int i = 1; i <= n; ++i)a[i] = read(); }
inline int inal(char* s) { int n = 0; for (s[0] = gc(); !isalpha(s[0]); s[0] = gc()); for (; isalpha(s[n]); s[++n] = gc()); return s[n] = 0, n; }
inline void outd(int* a, int n) { for (int i = 1; i <= n; ++i)printf("%d ", a[i]); enl; }
int n, m, q;
struct SAM { //最多2n-1个点和3n-4条边
    int len[MAXN << 1], link[MAXN << 1], ch[MAXN << 1][26]; //我们记 longest(v) 为其中最长的一个字符串，记 len(v) 为它的长度。
    int cnt[MAXN << 1], pos[MAXN], rpos[MAXN << 1], dif[MAXN << 1];
    int cur, lst, siz;
    SAM() { clear(); }
    void clear() {  //设置起始点S
        memset(ch, 0, sizeof(int) * (siz + 1) * 26);
        memset(cnt, 0, sizeof(int) * (siz + 1));
        memset(id, 0, sizeof(int) * (siz + 1));
        memset(rpos, 0, sizeof(int) * (siz + 1));
        len[0] = 0;
        link[0] = -1;
        siz = 0;    //siz设置成0实际上有一个点，方便标记
        lst = cur = 0;
    }
    void extend(int c, int id) {
        lst = cur, cur = ++siz;
        len[cur] = len[lst] + 1;
        cnt[cur] = 1;
        for (; ~lst && !ch[lst][c]; lst = link[lst])ch[lst][c] = cur;

        if (lst == -1) {
            link[cur] = 0;
        } else {
            int q = ch[lst][c];
            if (len[lst] + 1 == len[q]) {
                link[cur] = q;
            } else {        //克隆的点是q(lst的c后继)
                int clone = ++siz;
                link[clone] = link[q];
                len[clone] = len[lst] + 1;
                link[cur] = link[q] = clone;
                for (; ~lst && ch[lst][c] == q; lst = link[lst])ch[lst][c] = clone;
                memcpy(ch[clone], ch[q], sizeof(ch[q]));
            }
        }
        pos[id] = cur;
        rpos[cur] = id;
    }

    vector<int>e[MAXN << 1];
    int fa[MAXN << 1][LOG];
    int sz[MAXN << 1], son[MAXN << 1], top[MAXN << 1], edr[MAXN << 1];      //edr链底标号
    void dfs(int x) {
        for (int i = 1; i < LOG; ++i)
            fa[x][i] = fa[fa[x][i - 1]][i - 1];
        sz[x] = 1;
        for (auto v : e[x]) {
            dfs(v);
            sz[x] += sz[v];
            rpos[x] = max(rpos[x], rpos[v]);
            if (!son[x] || sz[son[x]] < sz[v] || sz[son[x]] == sz[v] && rpos[son[x]] < rpos[v])
                son[x] = v;
        }
    }
    int id[MAXN << 1], bc, bac[MAXN << 1];
    // id 重链的编号 ，bc为链的个数，bac编号对应的SAM节点
    void dfs(int x, int rt) {
        top[x] = rt;
        if (son[x])
            dfs(son[x], rt);
        if (son[x]) edr[x] = edr[son[x]];
        else edr[x] = rpos[x];
        for (auto v : e[x])
            if (v != son[x]) {
                bac[id[v] = ++bc] = v;
                dfs(v, v);
            }
    }
    void build() {
        for (int i = 1; i <= siz; ++i) {
            e[link[i]].push_back(i);
            fa[i][0] = link[i];
            dif[i] = len[i] - len[link[i]];
        }
        dfs(0); son[0] = 0;
        dfs(0, 0);
    }
    // void merge() {
    //     for (int i = siz; i >= 1; --i)if (!id[i])
    //         for (int c = 0; c < 26; ++c)if (ch[i][c]) {
    //             id[i] = id[ch[i][c]];
    //             break;
    //         }
    // }


    int FindR(int l, int r) {
        int x = pos[r];
        for (int i = LOG - 1; i >= 0; --i)
            if (len[fa[x][i]] >= r - l + 1)
                x = fa[x][i];
        return x;
    }

    int flen(int x) {
        return len[link[x]] + 1;
    }
}sam, rsam;
char s[MAXN];
// vector<int>row[MAXN], col[MAXN];
// int Ec = 0;
array<int, 3> ans[MAXN];

void work() {
    for (int i = 1; i <= n; ++i)
        sam.extend(s[i] - 'a', i);
    reverse(s + 1, s + n + 1);
    for (int i = 1; i <= n; ++i)
        rsam.extend(s[i] - 'a', i);
    sam.build(); rsam.build();
    // for (int i = 1; i <= sam.siz; ++i) {
    //     int r = sam.rpos[i],
    //         l = r - sam.len[i] + 1,
    //         u = rsam.FindR(n - r + 1, n - l + 1);
    //     if (r - l + 1 == rsam.len[u]) sam.id[i] = rsam.id[u] = ++Ec;
    // }
    // sam.merge(); rsam.merge();
    // for (int i = sam.siz; i >= 1; --i)
    //     row[sam.id[i]].push_back(i);
    // for (int i = rsam.siz; i >= 1; --i)
    //     col[rsam.id[i]].push_back(i);
    // outd(sam.edr, sam.siz);
    // outd(rsam.edr, rsam.siz);

}


struct SGT {    //求区间出现最靠右(大)的元素
    int L, R, sum[MAXN << 3];
    void init(int l, int r) { L = l, R = r; }
    void modify(int p, int l, int r, int tar, int v) {
        if (l == r)return sum[p] += v, void();
        int mid = (l + r) >> 1;
        if (tar <= mid) modify(p << 1, l, mid, tar, v);
        else modify(p << 1 | 1, mid + 1, r, tar, v);
        sum[p] = (sum[p << 1] + sum[p << 1 | 1]);
    }
    void modify(int tar, int v) {
        modify(1, L, R, tar, v);
    }
    int queryT(int p, int l, int r, int ql, int qr) {
        if (!sum[p] || ql > r || qr < l)return -inf;
        int mid = (l + r) >> 1;
        if (l == r)return mid + L - 1;
        int qryr = queryT(p << 1 | 1, mid + 1, r, ql, qr);
        if (qryr == -inf)return queryT(p << 1, l, mid, ql, qr);
        else return qryr;
    }
    int queryG(int p, int l, int r, int ql, int qr) {
        if (!sum[p] || ql > r || qr < l)return inf;
        int mid = (l + r) >> 1;
        if (l == r)return mid + L - 1;
        int qryl = queryG(p << 1, l, mid, ql, qr);
        if (qryl == inf)return queryG(p << 1 | 1, mid + 1, r, ql, qr);
        else return qryl;
    }
    int queryS(int p, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr)return sum[p];
        int mid = (l + r) >> 1, res = 0;
        if (ql <= mid)res += queryS(p << 1, l, mid, ql, qr);
        if (qr > mid)res += queryS(p << 1 | 1, mid + 1, r, ql, qr);
        return res;
    }
    array<int, 3> query(int ql, int qr) {
        return {queryT(1, L, R, ql, qr), queryG(1, L, R, ql, qr), queryS(1, L, R, ql, qr)};
    }
}sgt;

struct QRY {
    int id, tpos, rpos, len;    //询问id,链顶端sam的下标，这个点的pos，链长
};
vector<QRY>Q[MAXN << 1];

void prv(int id, int l, int r) {
    int u = sam.FindR(l, r), v = rsam.FindR(n - r + 1, n - l + 1);
    for (u = sam.link[u], v = rsam.link[v]; u && v;) {
        int fu = sam.top[u], fv = rsam.top[v];
        int dl = sam.flen(fu), dr = sam.len[u];     //链对应所以点的长度 [dl,dr]
        int il = rsam.flen(fv), ir = rsam.len[v];   //[il,ir]
        Q[sam.id[fu]].push_back({id, fv, v, min(r - l, sam.len[u])});
        if (dl < il)v = rsam.link[fv];
        else u = sam.link[fu];
    }
}

struct OPT {
    array<int, 3> operator()(array<int, 3> a, array<int, 3> b) {
        return {max(a[0], b[0]), min(a[1], b[1]), a[2] + b[2]};
    }
}opt;

struct seg { int d, x, y, op; };    // (id,len) (反sam的链底标号，串长)，构成的二维平面的线段
void slv(int lid) {
    vector<seg>vec;
    for (int x = sam.bac[lid]; x; x = sam.son[x]) {
        int flen = sam.flen(x), r = sam.rpos[x], l = r - flen + 1, u = rsam.FindR(n - r + 1, n - l + 1);
        int nxt = rsam.edr[u], k = flen - nxt;
        // printf("%d %d\n", nxt, k);
        vec.push_back({sam.len[x] - k, k, k, 0});   //出现位置，斜线，最长的len，因为链的标号是连续的，所以直接-k
        vec.push_back({nxt - 1, k, k, -2});         //消失位置，最短的len
    }
    // --------------
    // -------|------ y
    // -------|------
    // -------|------ x
    // --------------
    //        d

    for (auto& [id, tp, rp, len] : Q[lid]) {
        int x = rsam.edr[tp], l = rsam.flen(tp), r = min(rsam.len[rp], len);
        if (l <= r)vec.push_back({x, l - x, r - x, id});    //竖线，旋转后-x
    }
    sort(all(vec), [](auto a, auto b) {return a.d > b.d || (a.d == b.d && a.op < b.op); });
    for (auto& [d, x, y, op] : vec) {       //y轴从上往下
        // if (op <= 0)printf("%d += %d\n", x, op + 1);
        if (op <= 0)sgt.modify(x, op + 1);
        else {
            array<int, 3> s = sgt.query(x, y); s[0] += d + n + 5; s[1] += d + n + 5;
            // printf("%d %d %d\n", s[0], s[1], s[2]);
            ans[op] = opt(ans[op], s);
        }
    }
}

void solve() {
    n = inal(s + 1);
    work();
    m = read();
    for (int i = 1; i <= m; ++i) {
        int l = read() + 1, r = read() + 1;
        prv(i, l, r);
        ans[i][1] = inf;
    }
    sgt.init(-n - 4, n + 4);
    for (int i = 1; i <= sam.bc; ++i)
        slv(i);
    for (int i = 1; i <= m; ++i)
        if (ans[i][2] == 0)
            printf("-1\n");
        else
            printf("%d %d %d\n", ans[i][1], ans[i][0], ans[i][2]);
}
signed main(signed argc, char const* argv[]) {
    clock_t c1 = clock();
#ifdef LOCAL
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
#endif
    //=============================================================
    int TxT = 1;
    // TxT = read();
    while (TxT--)
        solve();
    //=============================================================
#ifdef LOCAL
    end :
    cerr << "Time Used:" << clock() - c1 << "ms" << endl;
#endif
    return 0;
}