1038:Warfare

时间限制: 2 S | 内存限制: 65536 KB
Accept: 0 | Submit: 0
[提交] [状态] [讨论版]
描述

JG loves watching war movies! There's a game description with a war.

There are two teams, each of many people. There are 3 rounds of fighting, in each round the two teams send some people to fight. In each round, whichever team sends more people wins, and if the two teams send the same amount of people, First team wins. Each person can be sent out to only one round. The team wins 2 rounds win the whole game. Note, the arrangement of the fighter in three rounds must be decided before the whole game starts.

We know that there are N people on the First team, and that there are M people on the opposite team. Now jg wants to know whether there exists an arrangement of people for the First team so that they can always win, no matter how the opposite team arrange their people.

输入

The first line contains an integer T, meaning the number of the cases. 1 <= T <= 50.

For each test case, there's one line consists of two integers N and M. (1 <= N, M <= 10^9).

输出

For each test case, Output "Yes" if there exists an arrangement of people so that the First team can always win. "No" if there isn't such an arrangement. (Without the quotation marks.)

样例输入
2
100 100
200 100
样例输出

No

Yes 

HINT


来源
XUJC OJ