You are given two integers n and k.
A string consists of 0 and 1s you can perform the following operations on it in a string S.
Choose a substring K and change '0' to '1' and vice versa in it.
Determine whether it is possilbe to convert every character of the string S to '0'.

Constraints:
1<=n<=100000
1<=K<=100000