문제

Note: The time limit for this problem is 4s, twice the default.

Bessie wants to go to sleep, but the farm's lights are keeping her awake. How can she turn them off?

Bessie has two bit strings of length $N$ ($2\le N\le 20$), representing a sequence of lights and a sequence of switches, respectively. Each light is either on (1) or off (0). Each switch is either active (1) or inactive (0).

A move consists of the following sequence of operations:

Toggle exactly one switch (set it to active if it is inactive, or vice versa).For each active switch, toggle the state of the corresponding light (turn it off if it is on, or vice versa).Cyclically rotate the switches to the right by one. Specifically, if the bit string corresponding to the switches is initially $s_0s_1\dots s_{N-1}$ then it becomes $s_{N-1}s_0s_1\dots s_{N-2}$.

For $T$ ($1\le T\le 2\cdot 10^5$) instances of the problem above, count the minimum number of moves required to turn all the lights off.

입력

First line contains $T$ and $N$.

Next $T$ lines each contain a pair of length-$N$ bit strings.

출력

For each pair, the minimum number of moves required to turn all the lights off.

예제 입력 1

4 3
000 101
101 100
110 000
111 000

예제 출력 1

0
1
3
2

예제 입력 2

1 10
1100010000 1000011000

예제 출력 2

2

점수

Inputs 3-5: $N \le 8$Inputs 6-13: $N\le 18$Inputs 14-20: No additional constraints.