+ Time limit: 1 second + Memory limit: 256 megabytes ---------- Froot, who loves chocolate, enters Wonderland (the same place Alice went) and immediately spots a row of chocolates of length $n$. Froot is about to eat all the chocolates when suddenly Cheshire (the cat that appeared and disappeared in smoke) appears and tells Froot, "You can only eat the chocolates in contiguous segments of length $k!"$ Froot, taken aback, asks for your help to determine if they can eat all the chocolates or not! || |:--------:| | I heard you like chocolate | # Input The input consists of a single line containing two natural numbers $n$ and $k$, separated by a space. $$1 \le n, k \le 10^9$$ # Output Your output must consist of a single line. If Froot can eat all the chocolates, print `YES`; otherwise, print `NO`. # Example ## Sample Input 1 ``` 10 10 ``` ## Sample Output 1 ``` YES ``` Froot eats all the chocolates instantly in a desperate move. ## Sample Input 2 ``` 12 4 ``` ## Sample Output 2 ``` YES ``` One possible method: first chocolates 5, 6, 7, 8, then chocolates 9, 10, 11, 12, and finally 1, 2, 3, 4. ## Sample Input 3 ``` 100 52 ``` ## Sample Output 3 ``` NO ``` In the first move, if Froot eats 52 chocolates in any way, 48 chocolates remain, which cannot be eaten by any subsequent move. After this test, Cheshire turned to Froot and said, "See? Even your friends couldn't help you."