func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long M = 1000000007;   const long long N = 1e5;   long long expo(long long x, long long y) {     long long res = 1;     x = x % M;     while (y > 0) {       if (y & 1) res = (res * x) % M;       y = y >> 1;       x = (x * x) % M;     }     return (res) % M;   }   string binary(long long n) {     if (n == 0) return  0 ;     string s;     while (n > 0) {       if (n & 1)         s +=  1 ;       else         s +=  0 ;       n >>= 1;     }     reverse(s.begin(), s.end());     return s;   }   bool isPrime(long long n) {     if (n <= 1) return false;     if (n <= 3) return true;     if (n % 2 == 0 || n % 3 == 0) return false;     for (long long i = 5; i * i <= n; i = i + 6) {       if (n % i == 0 || n % (i + 2) == 0) return false;     }     return true;   }   long long ncr(long long n, long long r) {     if (r > n - r) r = n - r;     long long ans = 1;     for (long long k = 0; k < r; k++) {       ans *= (n - k);       ans /= (k + 1);     }     return ans;   }   void solve() {     long long n, d;     cin >> n >> d;     if (n >= d) {       cout <<  YES n ;       return;     }     long long val = n / 2 + ceil(d / (1.0 * (n / 2 + 1)));     if (val <= n) {       cout <<  YES n ;     } else {       cout <<  NO n ;     }   }   int main() {     ios_base::sync_with_stdio(false);     cout.tie(0);     cin.tie(0);     ;     long long test = 1;     cin >> test;     while (test--) solve();     return 0;   }   