#include <bits/stdc++.h>
using namespace std;
long long qpow(long long a, long long b, long long mod) {
  long long r = 1;
  for (; b; b >>= 1) {
    if (b & 1) r = (r * a) % mod;
    a = (a * a) % mod;
  }
  return r;
}
long long C(int n, int m) {
  if (m < n - m) m = n - m;
  long long ans = 1;
  for (int i = m + 1; i <= n; i++) ans *= i;
  for (int i = 1; i <= n - m; i++) ans /= i;
  return ans;
}
const long long mod = 1e9 + 7;
const long long INF = 9e18;
const int inf = 2147483647;
const int N = 2e5 + 5;
void work() {
  int n, d;
  scanf("%d%d", &n, &d);
  if (d <= n)
    puts("YES");
  else {
    int x = sqrt(d) - 1;
    int m = d / (x + 1);
    if (d % (x + 1)) m++;
    if (x + m <= n)
      puts("YES");
    else
      puts("NO");
  }
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) work();
  return 0;
}
