Problem A. Dasha and lemonade Input file: standard input Output file: standard output Time limit: 2 seconds Memory limit: 256 megabytes Dasha loves lemonade! Today she went to the store and bought n bottles of lemonade. Capacity of each bottle is t liters. She put the bottles in line and started to do the following: she takes one bottles, drinks 1 liter from this bottle, put the bottle back and moves to the next bottle. Let's call this set of operations as one step. (After the last bottle she moves to the first one.) In the beginning, all the bottles are full of lemonade. Dasha wants to determine whether there will be any empty bottle after k steps or not. Help her. Input The first line contains three integers n, t and k (1 <>