#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 100005;
const double PI = 4 * atan(1);
const long long MAX = 9223372036854775807;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
  for (long long i = 2; i <= (int)sqrt(u); i++) {
    if (u % i == 0) return 0;
  }
  return 1;
}
long long mod(long long to_mod, long long MOD) {
  to_mod %= MOD;
  while (to_mod < 0) to_mod += MOD;
  return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b) {
  long long res = 0;
  while (b) {
    if (b & 1) res = (res + a);
    a = (2 * a);
    b >>= 1;
  }
  return res;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long n, m, q, y, k, z, w, t, l, r, res, ans, x, a, b;
long long xx, yy, xxx, yyy, xx1, yy1;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> q;
  while (q--) {
    cin >> n >> k;
    res = 0;
    a = 0;
    while (a < n && res < k && res >= 0) {
      res += (1ll << a) * (1ll << a);
      a++;
    }
    if (res < k && res >= 0) {
      cout << "NO\n";
      continue;
    }
    b = n;
    a = 1;
    vector<pair<long long, long long> > v;
    while (k >= (1ll << a) - 1 && b > 0) {
      k -= (1ll << a) - 1;
      b--;
      if (a == 1) {
        v.push_back(make_pair(n - a, 1));
      } else {
        v.push_back(make_pair(n - a, 4 * v[a - 2].second + 1));
      }
      a++;
    }
    res = 0;
    for (auto t : v) {
      if (res > k || res < 0) break;
      a = 1;
      long long u = t.second;
      while (res >= 0 && a <= t.first) {
        if (res > k) break;
        res += u * (1ll << (a - 1)) * (1ll << (a - 1));
        a++;
      }
    }
    if (res >= k || res <= 0) {
      cout << "YES " << b << "\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
