Z - Pedantic RobbersA team of n (1<=n<=106) robbers have stolen a large amount of gold and want to divide it fairly amongst themselves. In order to be absolutely fair, they want the division to be exact, up to the molecule. There are m (0<=m<=101000) molecules of gold in total. Can they do it, or will a fight erupt? InputThe input will contain a number of test cases, each occupying two lines. The first line will contain the number n, and the second one - the number m. OutputOutput one line per test case - "yes" if the gold can be fairly divided and "no" if not. Sample input10 1000000000 3 999999998 Sample outputyes no |