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: # import collections
  # import random
  # import math
  import itertools
  # import math
  # mport math
  from collections import defaultdict
  import itertools
  # from sys import stdin, stdout
  import math
  import sys
  
  import bisect
  # import operator
  # from decimal import Decimal
  
  # sys.setrecursionlimit(10**6)
  
  p2D = lambda x: print(*x, sep="\n")
  def II(): return int(sys.stdin.buffer.readline())
  def MI(): return map(int, sys.stdin.buffer.readline().split())
  def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
  def LLI(rows_number): return [LI() for _ in range(rows_number)]
  def BI(): return sys.stdin.buffer.readline().rstrip()
  def SI(): return sys.stdin.buffer.readline().rstrip().decode()
  def li(): return [int(i) for i in input().split()]
  def lli(rows): return [li() for _ in range(rows)]
  def si(): return input()
  def ii(): return int(input())
  def ins(): return input().split()
  
  
  mod = 10**9+7
  def solve():
      n, k = LI()
      s = bin(k).lstrip('0b')[::-1]
      p = 1
      ans = 0
      for si in s:
          if si == '1':
              ans = (ans+p)%mod
          p = (p*n)%mod
      return (ans)
      #return str(-(n-1))+ ' ' + str(n)
  
  
  
  
  
  
  def main():
      #print('finish '+ str(solve()), flush=True)
      for _ in range(II()):
          sys.stdout.write(str(solve()) + "\n")
      #sys.exit(0)
      #print(solve())
  
      #     z += str(ans) + '\n'
      # print(len(ans), ' '.join(map(str, ans)), sep='\n')
      # stdout.write(z)
  
  
  # for interactive problems
  # print("? {} {}".format(l,m), flush=True)
  # or print this after each print statement
  # sys.stdout.flush()
  
  
  if __name__ == "__main__":
      main()