CF1437A.Marketing Scheme

You got a job as a marketer in a pet shop, and your current task is to boost sales of cat food. One of the strategies is to sell cans of food in packs with discounts.

Suppose you decided to sell packs with $a$ cans in a pack with a discount and some customer wants to buy $x$ cans of cat food. Then he follows a greedy strategy:

• he buys $\left\lfloor \frac{x}{a} \right\rfloor$ packs with a discount;
• then he wants to buy the remaining $(x \bmod a)$ cans one by one.

$\left\lfloor \frac{x}{a} \right\rfloor$ is $x$ divided by $a$ rounded down, $x \bmod a$ is the remainer of $x$ divided by $a$.

But customers are greedy in general, so if the customer wants to buy $(x \bmod a)$ cans one by one and it happens that $(x \bmod a) \ge \frac{a}{2}$ he decides to buy the whole pack of $a$ cans (instead of buying $(x \bmod a)$ cans). It makes you, as a marketer, happy since the customer bought more than he wanted initially.

You know that each of the customers that come to your shop can buy any number of cans from $l$ to $r$ inclusive. Can you choose such size of pack $a$ that each customer buys more cans than they wanted initially?

你受聘为一家宠物店的营销人员，当前的任务是提升猫粮的销量。其中一种策略是以折扣价将猫粮罐头打包销售。

假设你决定以每包 $a$ 罐的方式进行折扣销售，而某位顾客希望购买 $x$ 罐猫粮。该顾客将采用贪心策略：

• 他首先购买 $\left\lfloor \frac{x}{a} \right\rfloor$ 包折扣装；
• 然后他打算单独购买剩余的 $(x \bmod a)$ 罐。

其中，$\left\lfloor \frac{x}{a} \right\rfloor$ 表示 $x$ 除以 $a$ 后向下取整，$x \bmod a$ 表示 $x$ 除以 $a$ 的余数。

但顾客总体上是贪心的：若顾客打算单独购买 $(x \bmod a)$ 罐，且恰好满足 $(x \bmod a) \ge \frac{a}{2}$，则他会转而购买一整包 $a$ 罐（而非仅买 $(x \bmod a)$ 罐）。这让你——作为营销人员——感到高兴，因为顾客最终购买的数量超过了其最初的需求量。

已知光顾你店铺的每位顾客，其计划购买的罐头数量均在区间 $[l, r]$ 内（含端点）。是否存在某个打包规格 $a$，使得每一位顾客最终购买的罐头总数都严格大于其最初计划购买的数量？

The first line contains a single integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The first and only line of each test case contains two integers $l$ and $r$ ($1 \le l \le r \le 10^9$) — the range of the number of cans customers can buy.

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 测试用例的数量。

每个测试用例仅有一行，包含两个整数 $l$ 和 $r$（$1 \le l \le r \le 10^9$）—— 顾客可购买的罐头数量的范围。

For each test case, print YES if you can choose such size of pack $a$ that each customer buys more cans than they wanted initially. Otherwise, print NO.

You can print each character in any case.

对于每个测试用例，如果存在某个包装规格 $a$，使得每位顾客购买的罐头数量均多于其最初想要的数量，则输出 YES；否则输出 NO。

你可以以任意大小写形式输出每个字符。

In the first test case, you can take, for example, $a = 5$ as the size of the pack. Then if a customer wants to buy $3$ cans, he'll buy $5$ instead ($3 \bmod 5 = 3$, $\frac{5}{2} = 2.5$). The one who wants $4$ cans will also buy $5$ cans.

In the second test case, there is no way to choose $a$.

In the third test case, you can take, for example, $a = 80$.

在第一个测试用例中，例如可取 $a = 5$ 作为包装规格。此时，若顾客想购买 $3$ 罐，他将实际购买 $5$ 罐（因为 $3 \bmod 5 = 3$，且 $\frac{5}{2} = 2.5$）。想购买 $4$ 罐的顾客也将购买 $5$ 罐。

在第二个测试用例中，不存在满足条件的 $a$。

在第三个测试用例中，例如可取 $a = 80$。