description: Theofanis really likes sequences of positive integers, thus his teacher (Yeltsa Kcir) gave him a problem about a sequence that consists of only special numbers.
  
  Let's call a positive number special if it can be written as a sum of different non-negative powers of n. For example, for n = 4 number 17 is special, because it can be written as 4^0 + 4^2 = 1 + 16 = 17, but 9 is not.
  
  Theofanis asks you to help him find the k-th special number if they are sorted in increasing order. Since this number may be too large, output it modulo 10^9+7.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.
  
  The first and only line of each test case contains two integers n and k (2 ≤ n ≤ 10^9; 1 ≤ k ≤ 10^9).
  
  Output
  
  For each test case, print one integer — the k-th special number in increasing order modulo 10^9+7.
  
  Example
  
  Input
  
  
  3
  3 4
  2 12
  105 564
  
  
  Output
  
  
  9
  12
  3595374
  
  Note
  
  For n = 3 the sequence is [1,3,4,9...]
solution: 
  mod = (10**9) +7
  def solve(st,base):
      start=0
      ans=0
      for i in st[::-1]:
          if(i=='1'):
              ans+= (base**start)%mod
          start+=1
      return ans%mod
  
  
  
  def fun(ls):
      base , k = ls
      summ =0
      count=-1
      if(k==1):
          print(1)
          return
      while(summ<k):
          count+=1
          summ+= (2**count)
          
      last = 2**count
      if(summ==k):
          last_add = 2**(count)
          current = summ - last_add
          in_bin = k-current - 1
          bn = bin(in_bin)[2:]
          st = '1'+ (count-len(bn))*"0"+bn
          print(solve(st,base))
      else:
          last_add = 2**(count)
          current = summ - last_add
          in_bin = k-current - 1
          bn = bin(in_bin)[2:]
          st = '1'+ (count-len(bn))*"0"+bn
          print(solve(st,base))
  
  
  
  
  
  T = int(input())
  # T=1
  for i in range(T):
      # st= input()
      # n = int(input())
      ls = list(map(int, input().split()))
      # ls = list(map(int, input().split()))
      fun(ls)
  
  
  