[3752]:Is the one been second-killed first?

Problem Description
Long long ago, a problem was spread all over the world , but no one could solve it . Now, due to the Internet , it has been solved perfectly(See figure 1).

Now here’s a problem much harmonious.
ErEr has big cake weighing m grams , at the same time he has n children . and every children want a part of the cake weighs even number(偶数) of grams. The children are extremely hungry and want to start their meal as soon as possible, that’s why you should help them and find out, if they can divide the cake in the way they want. For sure, each of them should get a part of positive weight.

Input
The first line of input gives the number of cases, T (at most 100).
each case has there numbers m,n. (1<=m<=10000，1<=n<=100)

Output
Print YES, if the boys can divide the cake into n parts, each of them weighing even number of kilos; and NO in the opposite case.

Sample Input
2
10 2
11 2

Sample Output
YES
NO

解题关键在于：上面加粗部分，意思就是说n(kg)的蛋糕，分成若干份，是否存在每一份都是偶数kg重

/*
  author : Yangchengfeng
*/


#include<stdio.h>

int main()
{
    int testTimes;
    scanf("%d", &testTimes);
    while(testTimes--){
        int n, m;
        scanf("%d%d", &n, &m);
        if(n%2==0){ // 点
            printf("YES\n");
        } else {
            printf("NO\n");
        }
    }
    return 0;
}