Problem: You work as a system administrator in a dormitory, which has rooms one after another along a straight hallway. Rooms are numbered from to .
You have to connect all rooms to the Internet.
You can connect each room to the Internet directly, the cost of such connection for the -th room is coins.
Some rooms also have a spot for a router. The cost of placing a router in the -th room is also coins. You cannot place a router in a room which does not have a spot for it. When you place a router in the room , you connect all rooms with the numbers from to inclusive to the Internet, where is the range of router. The value of is the same for all routers.
Calculate the minimum total cost of connecting all rooms to the Internet. You can assume that the number of rooms which have a spot for a router is not greater than the number of routers you have.
Input Format: The first line of the input contains two integers and () — the number of rooms and the range of each router.
The second line of the input contains one string of length , consisting only of zeros and ones. If the -th character of the string equals to '1' then there is a spot for a router in the -th room. If the -th character of the string equals to '0' then you cannot place a router in the -th room.
Output Format: Print one integer — the minimum total cost of connecting all rooms to the Internet.
Note: In the first example it is enough to place the router in the room , then all rooms will be connected to the Internet. The total cost of connection is .
In the second example you can place routers nowhere, so you need to connect all rooms directly. Thus, the total cost of connection of all rooms is .
In the third example you need to connect the room directly and place the router in the room . Thus, the total cost of connection of all rooms is .
In the fourth example you need to place routers in rooms and . Then all rooms will be connected to the Internet. The total cost of connection is .