Xiao Tang and Xiao Ming had an argument, and Xiao Tang lost. But Xiao Tang really wants to win, so he's trying to find evidence that he actually won.

Xiao Ming posted a travel story on his social media, and Xiao Tang wants to extract evidence of Xiao Ming admitting defeat from it.

Specifically: Xiao Tang has converted Xiao Ming's story into a lowercase string $$$s$$$ of length $$$n$$$, where the $$$i$$$-th character is $$$s_i$$$.

Xiao Tang can perform the following operation at most $$$k$$$ times:

Insert any character at any position in $$$s$$$.

Please help Xiao Tang calculate, assuming he performs the operations optimally, what is the maximum number of substrings "lose" he can find in $$$s$$$.

Note: This problem requires finding substrings (contiguous sequences), not subsequences.