Candy distro

You have N candies. You have to distribute them to exactly M of your friends such that each friend gets equal number of candies and each friend gets even number of candies. Determine whether it is possible to do so.

NOTE: You will not take any candies yourself and will distribute all the candies.
        
       Input:-4
9 3
4 1
4 2
8 3
       Input Description: first line will contain T, number of test cases. Then The test cases follow.
-each test case contains of A single line of input, two integers N and M, The number of candies and The number of friends. 
       Output: No
Yes
Yes
No
       Output Description: -For each test case, the output will consist of a single line containing Yes if you can distribute the candies as per the conditions and No otherwise.
-You may print each character of the string in uppercase or lowercase (for example, the strings yes, Yes, yEs, and YES will all be treated as identical). 
       Constraints: 1<=T<=1000
1<=N,M<=1000
       Explanation: Test case 1: Since you have 9 candies and 3 friends, each friend will get 9/3 = 3 candies. Since 3 is not even, You don't satisfy the conditions.

Test case 2: Since you have 4 candies and 1 friend, each friend will get 4/1 = 4 candies. Since 4 is even, You satisfy all the conditions.

Test case 3: Since you have 4 candies and 2 friends, each friend will get 4/2 candies. Since 2 is even, You satisfy all the conditions.

Test case 4: Since you have 8 candies and 3 friends. Since you won't be able to distribute all the candies equally, you don’t satisfy all the conditions.