1.寻找k个"mihoyo"的最短子串 n, k = list(map(int, input().split())) s = input() target = 'mihoyo' def func(s): if n < k * 6: print(-1) return elif target * k in s: idx = s.find(target * k, 0, n) print(idx, idx+6 * k-1) return else: l...