1658F - Juju and Binary String - CodeForces Solution

from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))


def solve():
    n, m = rl()
    s = input()
    ones = s.count("1")
        if (ones * m) % n != 0:
        print (-1)
        return
    else:
        need = (ones * m) // n

    have = 0
    for i in range(m):
        if s[i] == "1":
            have += 1

    if have == need:
        print (1)
        print (1, m)
        return

    s = s + s
    for i in range(m, 2 * n):
        if s[i] == "1":
            have += 1
        if s[i - m] == "1":
            have -= 1
                if have == need:
            if i < n:
                print (1)
                print (i - m + 2, i + 1)
                return
            else:
                print (2)
                print (1, i - n + 1)
                print (i - m + 2, n)
                return







mode = 'T'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()