public void Solve()
		{
			var (n, k, s) = cin.ReadValue<int, int, string>();
			var grundy = new int[n];
			s = s.Reverse().Join();
			s += "o";

			var seg = new SegmentTree<(int count, int index)>(
				Enumerable.Zip(Enumerable.Repeat(0, k + 2), Enumerable.Range(0, k + 2), (x, y) => (count: x, index: y)),
				(x, y) => (x.count == 0) ? x : ((y.count == 0) ? y : (int.MaxValue, -1)),
				(int.MaxValue, -1));

			int max = -1;
			for (int i = 0; i < k; i++)
			{
				if (s[i] == 'o')
				{
					max++;
					grundy[i] = max;
					seg.Update(max, (seg[max].count + 1, max));
				}
				else
				{
					grundy[i] = k + 1;
					seg.Update(k + 1, (seg[k + 1].count + 1, k + 1));
				}
			}
			for (int i = k; i < n; i++)
			{
				if (s[i] == 'o')
				{
					grundy[i] = seg.GetResult(0, k + 2).index;
					seg.Update(grundy[i], (seg[grundy[i]].count + 1, grundy[i]));
				}
				else
				{
					grundy[i] = k + 1;
					seg.Update(grundy[i], (seg[grundy[i]].count + 1, grundy[i]));
				}

				var g = grundy[i - k];
				seg.Update(g, (seg[g].count - 1, g));
			}

			var ans = new List<int>();

			for (int i = k; i >= 1; i--)
			{
				if (grundy[n - i - 1] == 0) ans.Add(i);
			}

			ans.Sort();

			if (grundy[n - 1] == 0) Console.WriteLine(0);
			else
			{
				foreach (var e in ans)
				{
					Console.WriteLine(e);
				}
			}
		}