#include<bits/stdc++.h>

using namespace std ;

#define LL long long

#define INF 0x3f3f3f3f

#define mod 1000000007

int FF(int n , int k)

{

     int curr = ;

        k = k - ;

        while (k > ) {

            long steps = , first = curr, last = curr + ;

            while (first <= n) {

                steps += min((long)n + , last) - first;

                first *= ;

                last *= ;

            }

            if (steps <= k) {

                curr += ;

                k -= steps;

            } else {

                curr *= ;

                k -= ;

            }

        }

        return curr;

}

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

        int n,k;

        scanf("%d%d",&n,&k);

        k--;

        int cnt=;

        while(k)

        {

            int st= , head=cnt , tail = cnt+;

            while(head<=n)

            {

                st+=min(n+,tail) - head;

                head*=;

                tail*=;

            }

            if(st<=k)

            {

                cnt++;

                k-=st;

            }

            else

            {

                cnt*=;

                k--;

            }

        }

        printf("%d\n",cnt);

    }

    return ;

}