Every problem maker has a flower in their heart out of love for ACM. As a famous problem maker, hery also has a flower. Hery define string T as flower-string if T appears more than twice in string S and |T| = k. Hery wants you to find how many flower-string in S.
Every problem maker has a flower in their heart out of love for ACM. As a famous problem maker, hery also has a flower. Hery define string T as flower-string if T appears more than twice in string S and |T| = k. Hery wants you to find how many flower-string in S.
（图片来源网络，侵删）
