Divisibility
– Bring the pudding! Alice, this is the pudding. Pudding, meet Alice. Now, let's divide the pudding! What do you mean, how to divide it? Weigh it and divide by the number of guests! And if it doesn't divide evenly? Rearrange the digits in the weight and try again! If it still doesn't work, we'll have to chop off the cook's head! Is rearranging difficult? Then convert it to binary, rearrange it there; there are only 2 digits!
– I wonder if they'll chop off the cook's head, – Alice pondered…
Help Alice solve this challenging and crucial problem for the cook.
Input
The first line contains a single integer N, (0 < N < 2^64) – the weight of the pudding. The second line contains a single integer K, (0 < K ≤ 10000) – the number of guests.
Output
On the first and only line, print YES if it is possible to divide the pudding evenly among the guests, either using the weight of the pudding directly or by rearranging the zeros and ones in its binary representation. Otherwise, print NO (and the cook will face the consequences).