Consecutive Girls

Boys and girls are standing in a single row, each person right next to the next. When a boy leaves the row, the two people who were on either side of him become neighbors.

We want $k$ girls to stand consecutively, side by side, with no boy standing among them. Find the minimum number of boys that must leave the row to make this possible.

The first line contains two integers $n$ and $k$ ($1 \le k \le n \le 10^6$): the number of people standing in the row and the number of girls we want to stand consecutively.

The second line contains $n$ integers, each $0$ or $1$, separated by spaces, describing the people in order along the row: $0$ is a girl and $1$ is a boy.

Print a single integer: the minimum number of boys that must leave the row. If it is impossible to make $k$ girls stand consecutively, print the word NIE instead.