CF1288A.Deadline

Adilbek was assigned to a special project. For Adilbek it means that he has $n$ days to run a special program and provide its results. But there is a problem: the program needs to run for $d$ days to calculate the results.

Fortunately, Adilbek can optimize the program. If he spends $x$ ($x$ is a non-negative integer) days optimizing the program, he will make the program run in $\left\lceil \frac{d}{x + 1} \right\rceil$ days ($\left\lceil a \right\rceil$ is the ceiling function: $\left\lceil 2.4 \right\rceil = 3$, $\left\lceil 2 \right\rceil = 2$). The program cannot be run and optimized simultaneously, so the total number of days he will spend is equal to $x + \left\lceil \frac{d}{x + 1} \right\rceil$.

Will Adilbek be able to provide the generated results in no more than $n$ days?

阿迪尔别克被分配了一个特殊项目。对他而言，这意味着他有 $n$ 天时间运行一个特殊程序并提交其结果。但存在一个问题：该程序需要连续运行 $d$ 天才能完成计算。

幸运的是，阿迪尔别克可以对程序进行优化。如果他花费 $x$（$x$ 为非负整数）天来优化程序，则优化后的程序只需 $\left\lceil \frac{d}{x + 1} \right\rceil$ 天即可运行完成（其中 $\left\lceil a \right\rceil$ 表示向上取整函数：例如 $\left\lceil 2.4 \right\rceil = 3$，$\left\lceil 2 \right\rceil = 2$）。程序无法在优化的同时运行，因此他总共耗费的天数为 $x + \left\lceil \frac{d}{x + 1} \right\rceil$。

阿迪尔别克能否在不超过 $n$ 天内提交生成的结果？

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

The next $T$ lines contain test cases – one per line. Each line contains two integers $n$ and $d$ ($1 \le n \le 10^9$, $1 \le d \le 10^9$) — the number of days before the deadline and the number of days the program runs.

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

接下来的 $T$ 行每行包含一个测试用例。每行包含两个整数 $n$ 和 $d$（$1 \le n \le 10^9$，$1 \le d \le 10^9$）——分别表示截止日期前的天数和程序运行所需的天数。

Print $T$ answers — one per test case. For each test case print YES (case insensitive) if Adilbek can fit in $n$ days or NO (case insensitive) otherwise.

输出 $T$ 个答案——每个测试用例对应一个答案。对于每个测试用例，如果 Adilbek 能在 $n$ 天内完成，则输出 YES（不区分大小写）；否则输出 NO（不区分大小写）。

In the first test case, Adilbek decides not to optimize the program at all, since $d \le n$.

In the second test case, Adilbek can spend $1$ day optimizing the program and it will run $\left\lceil \frac{5}{2} \right\rceil = 3$ days. In total, he will spend $4$ days and will fit in the limit.

In the third test case, it's impossible to fit in the limit. For example, if Adilbek will optimize the program $2$ days, it'll still work $\left\lceil \frac{11}{2+1} \right\rceil = 4$ days.

在第一个测试用例中，Adilbek 决定完全不优化程序，因为 $d \le n$。

在第二个测试用例中，Adilbek 可以花费 $1$ 天来优化程序，优化后程序将运行 $\left\lceil \frac{5}{2} \right\rceil = 3$ 天。总共他将花费 $4$ 天，从而满足时限要求。

在第三个测试用例中，无法满足时限要求。例如，若 Adilbek 优化程序 $2$ 天，则程序仍需运行 $\left\lceil \frac{11}{2+1} \right\rceil = 4$ 天。