Problem: Recently, Olya received a magical square with the size of 2^n× 2^n.

It seems to her sister that one square is boring. Therefore, she asked Olya to perform exactly k splitting operations.

A Splitting operation is an operation during which Olya takes a square with side a and cuts it into 4 equal squares with side a/2. If the side of the square is equal to 1, then it is impossible to apply a splitting operation to it (see examples for better understanding).

Olya is happy to fulfill her sister's request, but she also wants the condition of Olya's happiness to be satisfied after all operations.

The condition of Olya's happiness will be satisfied if the following statement is fulfilled:

Let the length of the side of the lower left square be equal to a, then the length of the side of the right upper square should also be equal to a. There should also be a path between them that consists only of squares with the side of length a. All consecutive squares on a path should have a common side.

Obviously, as long as we have one square, these conditions are met. So Olya is ready to fulfill her sister's request only under the condition that she is satisfied too. Tell her: is it possible to perform exactly k splitting operations in a certain order so that the condition of Olya's happiness is satisfied? If it is possible, tell also the size of the side of squares of which the path from the lower left square to the upper right one will consist.

Input

The first line contains one integer t (1 ≤ t ≤ 10^3) — the number of tests.

Each of the following t lines contains two integers n_i and k_i (1 ≤ n_i ≤ 10^9, 1 ≤ k_i ≤ 10^{18}) — the description of the i-th test, which means that initially Olya's square has size of 2^{n_i}× 2^{n_i} and Olya's sister asks her to do exactly k_i splitting operations.

Output

Print t lines, where in the i-th line you should output "YES" if it is possible to perform k_i splitting operations in the i-th test in such a way that the condition of Olya's happiness is satisfied or print "NO" otherwise. If you printed "YES", then also print the log_2 of the length of the side of the squares through space, along which you can build a path from the lower left square to the upper right one.

You can output each letter in any case (lower or upper).

If there are multiple answers, print any.

Example

Input


3
1 1
2 2
2 12


Output


YES 0
YES 1
NO

Note

In each of the illustrations, the pictures are shown in order in which Olya applied the operations. The recently-created squares are highlighted with red.

In the first test, Olya can apply splitting operations in the following order:

<image> Olya applies one operation on the only existing square.

The condition of Olya's happiness will be met, since there is a path of squares of the same size from the lower left square to the upper right one:

<image>

The length of the sides of the squares on the path is 1. log_2(1) = 0.

In the second test, Olya can apply splitting operations in the following order:

<image> Olya applies the first operation on the only existing square. She applies the second one on the right bottom square.

The condition of Olya's happiness will be met, since there is a path of squares of the same size from the lower left square to the upper right one:

<image>

The length of the sides of the squares on the path is 2. log_2(2) = 1.

In the third test, it takes 5 operations for Olya to make the square look like this:

<image>

Since it requires her to perform 7 splitting operations, and it is impossible to perform them on squares with side equal to 1, then Olya cannot do anything more and the answer is "NO".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int t;
long long n, k;
pair<pair<long long, long long>, long long> fnd(long long levels) {
  long long res = 0, lst = 0;
  for (int i = 0; i < levels; i++) {
    lst += (1LL << i);
    if (res > k - lst) {
      return make_pair(make_pair(res, levels - i), lst);
    }
    res += lst;
  }
  lst += (1LL << levels);
  return make_pair(make_pair(res, 0), lst);
}
inline long long log4(long long n) {
  long long tot = 1, sum = 1;
  for (int i = 0; i <= n; i++) {
    if (sum >= n) return i + 1;
    tot *= 4;
    sum += tot;
  }
  assert(false);
}
inline long long total(long long levels) {
  if (levels == 0) return 0;
  long long tot = 1, sum = 1;
  for (int i = 1; i < levels; i++) {
    tot *= 4;
    sum += tot;
  }
  return sum;
}
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf(" %lld %lld", &n, &k);
    pair<pair<long long, long long>, long long> most = fnd(n);
    k -= most.first.first;
    long long req = log4(k);
    if (n > req)
      printf("YES %lld\n", most.first.second);
    else if (n == req) {
      long long side = most.second * total(most.first.second);
      long long rem = total(n) - most.first.first - side;
      if (rem >= k)
        printf("YES %lld\n", most.first.second);
      else
        printf("NO\n");
    } else
      printf("NO\n");
  }
}