408106: GYM102986 B Sharing Cheerios

Lang won first prize at a lottery! Unfortunately, instead of receiving lots of money, he has received a shipment of $$$n$$$ boxes of Cheerios. Obviously, Lang is not going to be able to finish too many boxes of Cheerios, but he does not know what to do with them. He reaches out to his $$$m$$$ friends that are available, and they each come one after another to share Lang's Cheerios. Lang decides to be generous, and gives each friend half of his remaining boxes of Cheerios (rounded up if necessary), in the order they come. He will continue until he either runs out of Cheerios, or he has no more available friends.

Given $$$n$$$, the number of boxes of Cheerios he has, and $$$m$$$, the number of friends he has available, determine how many friends will get Cheerios!

The first line of input contains $$$n (1 \le n \le 10^9)$$$ and $$$m (1 \le m \le 50)$$$, the number of Cheerio boxes and the number of friends Lang has available, respectively.

A single integer, the number of friends that Lang will give Cheerios to.

15 5

4