results = []
for _ in range(int(input())):
    s = input()
    n = len(s)
    ok = False
    l, r = 1, 1
    for i in range(n):
        if s[i] == '0':
            ok = True
            mx = '0' * (n - i)
            for j in range(i):
                cnt = ''
                cnt += ''.join(str(int(s[i + k] != s[j + k])) for k in range(n - i))
                if cnt > mx:
                    l, r = j, j + n - i - 1
                    mx = cnt
            break
    results.append(f'1 {n} {l + 1} {r + 1}') if ok else results.append(f'1 {n} 1 1')
print('\n'.join(results))

from collections import deque

INF = int(1e9)
LINF = int(1e18)
t = int(input())

for _ in range(t):
    n, m = map(int, input().split())
    a = list(map(int, input().split()))
    b = list(map(int, input().split()))
    v = a[0]
    a.sort()
    b.sort()
    q = deque(a)
    cnt = n
    c = [0] * (m + 1)
    
    for i in range(m):
        while q and q[0] < b[i]:
            q.popleft()
            cnt -= 1
        if q and q[0] <= v:
            c[i + 1] = 0
        else:
            c[i + 1] = cnt
    
    c.sort()
    
    for i in range(1, m + 1):
        ans = 0
        for j in range(i, m + 1, i):
            ans += c[j] + 1
        print(ans, end=' ')
    print()