#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i ++)
#define MP make_pair

using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;

int n, m, q;
char s[200005];
int rk[25][200005], nxt[200005], sa[200005];

int cnt[200005], tmp[200005];
void radsort(int d)
{
	int l = n - (1 << d) + 1,* A = rk[d - 1],* B = rk[d - 1] + (1 << (d - 1));
	rep(i, m) cnt[i] = 0;
	rep(i, l) cnt[B[i]] ++;
	rep1(i, m - 1) cnt[i] += cnt[i - 1];
	for(int i = l - 1; i >= 0; i --) tmp[-- cnt[B[i]]] = i;
	rep(i, m) cnt[i] = 0;
	rep(i, l) cnt[A[i]] ++;
	rep1(i, m - 1) cnt[i] += cnt[i - 1];
	for(int i = l - 1; i >= 0; i --) sa[-- cnt[A[tmp[i]]]] = tmp[i];
}

void gen_sa()
{
	rep(i, n) rk[0][i] = s[i];
	for(int d = 1; n >> d; d ++) {
		radsort(d);
		rk[d][sa[0]] = 0;
		int cur, pre;
		rep1(i, n - (1 << d)) {
			cur = sa[i]; pre = sa[i - 1];
			rk[d][cur] = rk[d][pre] + (rk[d - 1][cur] != rk[d - 1][pre] || rk[d - 1][cur + (1 << (d - 1))] != rk[d - 1][pre + (1 << (d - 1))]);
		}
	}
}

int ql[200005], qr[200005], mina[200005], maxa[200005], cnta[200005];
vector<int> lq[200005], rq[200005];
int mn0[200005], mx0[200005], mn1[200005], mx1[200005];

void calc(int& rn, int& rx, int& rc, int x, int l, int r, int d)
{
	if(x >= l && x <= r && x % d == l % d) {
		rn = min(rn, x); rx = max(rx, x); rc ++;
	}
}
void calc(int& rn, int& rx, int& rc, int la, int ra, int da, int lb, int rb, int db)
{
	if(ra - la <= da) for(int i = la; i <= ra; i += da) calc(rn, rx, rc, i, lb, rb, db);
	else if(rb - lb <= db) for(int i = lb; i <= rb; i += db) calc(rn, rx, rc, i, la, ra, da);
	else if(ra % da == rb % db && ra >= lb && rb >= la) {
		rn = min(rn, max(la, lb)); rx = max(rx, min(ra, rb)); rc += (min(ra, rb) - max(la, lb)) / da + 1;
	}
}

void solve(int d)
{
	rep(i, m) tmp[i] = n;
	int cur;
	for(int i = n - (1 << d); i >= 0; i --) {
		cur = rk[d][i]; nxt[i] = tmp[cur]; tmp[cur] = i;
	}
	
	rep(i, q) {
		mn0[i] = mn1[i] = n; mx0[i] = mn0[i] = -1;
	}
	int cp, cq;
	rep(i, m) tmp[i] = -1;
	for(int i = -(1 << d); i <= n; i ++) {
		if(i >= 0 && i <= (n - (1 << d))) tmp[rk[d][i]] = i;
		cp = i + (1 << d) - 1;
		if(cp >= 0 && cp < n) rep(j, rq[cp].size()) {
			cq = rq[cp][j];
			if((qr[cq] - ql[cq] + 1) >> d) mx0[cq] = tmp[rk[d][ql[cq]]];
		}
		cp = i - (1 << d) + 1;
		if(cp >= 0 && cp < n) rep(j, lq[cp].size()) {
			cq = lq[cp][j];
			if((qr[cq] - ql[cq] + 1) >> d) mx1[cq] = min(tmp[rk[d][qr[cq] - (1 << d) + 1]], qr[cq] - (1 << d) + 1);
		}
	}
	rep(i, m) tmp[i] = n;
	for(int i = n; i >= -(1 << d); i --) {
		if(i >= 0 && i <= (n - (1 << d))) tmp[rk[d][i]] = i;
		cp = i + (2 << d) - 2;
		if(cp >= 0 && cp < n) rep(j, rq[cp].size()) {
			cq = rq[cp][j];
			if((qr[cq] - ql[cq] + 1) >> d) mn0[cq] = max(tmp[rk[d][ql[cq]]], nxt[ql[cq]]);
		}
		cp = i;
		if(cp >= 0 && cp < n) rep(j, lq[cp].size()) {
			cq = lq[cp][j];
			if((qr[cq] - ql[cq] + 1) >> d) mn1[cq] = tmp[rk[d][qr[cq] - (1 << d) + 1]];
		}
	}
	
	rep(i, q) {
		if(mn0[i] > mx0[i] || mn1[i] > mx1[i]) continue;
		int dif0 = nxt[mn0[i]] - mn0[i], dif1 = nxt[mn1[i]] - mn1[i];
		swap(mn0[i], mx0[i]); mn0[i] = qr[i] - mn0[i] + 1; mx0[i] = qr[i] - mx0[i] + 1;
		mn1[i] += (1 << d) - ql[i]; mx1[i] += (1 << d) - ql[i];
		
		calc(mina[i], maxa[i], cnta[i], mn0[i], mx0[i], dif0, mn1[i], mx1[i], dif1);
	}
}

int main()
{
	scanf("%s%d", s, &q); n = strlen(s); m = max(128, n);
	gen_sa();
	rep(i, q) scanf("%d%d", &ql[i], &qr[i]);
	rep(i, q) {
		lq[ql[i]].push_back(i); rq[qr[i]].push_back(i);
	}
	
	rep(i, q) mina[i] = n;
	for(int d = 0; n >> d; d ++) solve(d);
	
	rep(i, q) if(cnta[i] == 0) printf("-1\n");
	else printf("%d %d %d\n", mina[i], maxa[i], cnta[i]);
	return 0;
}