ADACLEAN - Ada and Spring Cleaning

Ada the Ladybug has decided to do some "Spring Cleaning". As you might know, she keeps a TODO list. She is very sparing so she keeps all her activities as one string. You might get very confused while reading the string but she has a system - every activity has length exactly K characters. Sadly, as new activities were added to the list many duplicities appeared. Now it is time to find out how many unique activities are in her TODO list.


First line contains T, number of test-cases.

Each test-case begins with N, K, 1 ≤ K ≤ N ≤ 105, length of string and length of activites respectively.

Next line consists of string of length N, consisting of lowercase letters.

The sum of lengths of strings among all test-cases won't exceed 3*105


For each test-case, print the number of unique substrings of length K

Example Input

3 2
5 1
4 2
10 2
7 3

Example Output


hide comments
Palashvijay4O: 2016-10-29 23:29:05

getting WA.. dont know what's the issue.
Id - 18058212
Please check once. TIA

morass: 2016-10-11 21:24:51

@asshole: Asctivities are not one after another - they overlap, so there are N-K+1 activities in a string :)

asshole: 2016-10-11 19:43:25

I don't understand the question. since each activity is of k length shouldn't there the string length be multiple of k?

mehmetin: 2016-09-11 16:19:23

Accepted with PYPY, but WA with C++14...

Vipul Srivastava: 2016-09-11 09:23:03

what is the expected complexity of the solution?

it_is_me: 2016-09-10 21:00:51

Getting WA constantly anybody can please provide me a good test case to check my solution.
Submission ID-17689065

Last edit: 2016-09-10 21:07:36
aitya: 2016-09-09 18:55:06

Finally AC. Brilliant test cases.Shows how a problem is only as good as it's test cases :)

aditya730: 2016-09-09 17:22:23

Last edit: 2016-09-09 17:23:37
morass: 2016-09-09 16:20:10

@aitya: Hello, well I'm slightly afraid you are failing only "big" test-cases :'(

aitya: 2016-09-09 14:53:48

i am constantly getting wa.Can you tell whether i am failing the most basic test cases or the corner ones
submission ID-17680541

Added by:Morass
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU