You work as an engineer. You were given an empty board with $\ufffd$ consecutive cells; at any moment, each cell can display one character.

You want the board to display a string $\ufffd$ with length $\ufffd>\ufffd$. Since the board isn't large enough, you want to display the string in $\ufffd-\ufffd+1$ steps. In the $\ufffd$-th step ($1\le \ufffd\le \ufffd-\ufffd+1$), you'll make the board display the characters ${\ufffd}_{\ufffd},{\ufffd}_{\ufffd+1},\dots ,{\ufffd}_{\ufffd+\ufffd-1}$.

The power required to switch the board from step $\ufffd$ to step $\ufffd+1$ (for $1\le \ufffd\le \ufffd-\ufffd$) is equal to the number of characters displayed on the board that have to change between these steps. You should find the total power required for the whole process of displaying a string, i.e. the sum of powers required for switching between all consecutive pairs of steps.

### Input

- The first line of the input contains a single integer $\ufffd$ denoting the number of test cases. The description of $\ufffd$ test cases follows.
- The first line of each test case contains two space-separated integers $\ufffd$ and $\ufffd$.
- The second line contains a single string $\ufffd$ with length $\ufffd$.

### Output

For each test case, print a single line containing one integer — the total power required for text switching.

### Constraints

- $1\le \ufffd\le 1,000$
- $2\le \ufffd\le 1{0}^{5}$
- $1\le \ufffd<\ufffd$
- each character of $\ufffd$ is a lowercase English letter
- the sum of $\ufffd$ for all test cases does not exceed $1{0}^{6}$

### Subtasks

Subtask #1 (20 points):

- $1\le \ufffd\le 100$
- $2\le \ufffd\le 50$

Subtask #2 (80 points): original constraints

### Sample 1:

3 6 3 aabbcc 5 2 abccc 4 3 aabb

4 3 1

### Explanation:

Example case 1:

- In step $1$, the board is displaying "aab".
- In step $2$, the board is displaying "abb".
- In step $3$, the board is displaying "bbc".
- In step $4$, the board is displaying "bcc".

The power required for switching from the $1$-st to the $2$-nd step is $1$, because cell $1$ changes from 'a' to 'a' (requiring power $0$), cell $2$ changes from 'a' to 'b' (requiring power $1$) and cell $3$ changes from 'b' to 'b' (requiring power $0$); $0+1+0=1$.

The power required for switching between the $2$-nd and $3$-rd step is $2$ and the power required for switching between the $3$-rd and $4$-th step is $1$.

Therefore, the answer is $1+2+1=4$.

__Code(C++):-__

__Code(JAVA):-__

__Recommended Post ____:-__

__Recommended Post__

__:-__

__HCL Coding Questions:-__

__Capgemini Coding Questions:-__

__iMocha coding Questions:-__

__Tech Mahindra coding questions:-__

__Unthinkable Solutions coding questions:-__- Swap the adjacent characters of the string
- Double the vowel characters in the string
- Character with their frequency
- Program to find the closest value

__Must check this:-__

__Companies interview:-__- Swap adjacent characters
- Double the vowel characters
- Check valid parenthesis
- Print the characters with their frequencies
- Find closest value
- Word Count
- Program of CaesarCipher
- Program to find the perfect city
- Annual Day | Tech Mahindra coding question
- Find the number of pairs in the array whose sum is equal to a given target.

__Full C course:- __

__Key points:-__

- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
- How to check that given number is power of 2 or not
- How to fix limit in double and floating numbers after dot (.) in c++
- How to print a double or floating point number in scientific notation and fixed notation
- How to take input a string in c
- How to reduce the execution time of program in c++.

__Cracking the coding interview:-__

__Array and string:-__

__Tree and graph:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Hackerrank Problems:-__- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
- Sum of Digits of a Five Digit Number | hackerrank practice problem solution
- 1D Arrays in C | hackerrank practice problem solution
- Array Reversal | hackerrank practice problem solution
- Printing Tokens | hackerrank practice problem solution
- Digit Frequency | hackerrank practice problem solution
- Calculate the Nth term | hackerrank practice problem solution

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__ MCQs:-__

## 0 Comments