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 java.util.*;
  
  // import org.graalvm.compiler.hotspot.nodes.type.KlassPointerStamp;
  
  import java.io.*;
  public class justFun{
      static FastReader sc=new FastReader();
      static final Random random=new Random();
      static int mod=1000000007;
      static HashMap<String,Integer>map=new HashMap<>();
   
      public static void main(String args[]) throws IOException {
         
          int t = sc.nextInt();
          //StringBuilder res=new StringBuilder(sc.nextLine());
         while(t-->0){
          long n = sc.nextLong();
          long k = sc.nextLong();
          long val = 1;
          long ans=0;
          for(long i=0;i<=30;i++){
              if((k&(1<<i))!=0){
                  ans=(ans+val)%mod;
              }
              val=(val*n)%mod;
          }
          System.out.println(ans);
          
  
  
  
  
         }
  
  
  
  
   
      }
   
   
   
   
   
   
      static int max(int a, int b)
      {
          if(a<b)
          	return b;
          return a;
      }
      public static long fastPower(long a,long b,int n){
          //a^b%n=100000007
          long res=1;
          a=a%n;
          if(a==0)
          return 0;
   
          
          while(b>0){
              if((b&1)!=0){ //if odd
                  res=(res * a%n)%n;
   
   
              }
              a=(a%n*a%n)%n;
              b=b>>1;
          }
          return res;
   
      }
   
   
      static void ruffleSort(int[] a) {
          int n=a.length;
          for (int i=0; i<n; i++) {
              int oi=random.nextInt(n), temp=a[oi];
              a[oi]=a[i]; a[i]=temp;
          }
          Arrays.sort(a);
      }
   
      static < E > void print(E res)
      {
          System.out.println(res);
      }
   
   
      static  int gcd(int a,int b)
      {
          if(b==0)
          {
              return a;
          }
          return gcd(b,a%b);
      }
   
      static int lcm(int a, int b)
      {
          return (a / gcd(a, b)) * b;
      }
   
   
      static int abs(int a)
      {
          if(a<0)
              return -1*a;
          return a;
      }
   
      static class FastReader
      {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(new
                      InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements())
              {
                  try
                  {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException  e)
                  {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          int nextInt()
          {
              return Integer.parseInt(next());
          }
   
          long nextLong()
          {
              return Long.parseLong(next());
          }
   
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
          String nextLine()
          {
              String str = "";
              try
              {
                  str = br.readLine();
              }
              catch (IOException e)
              {
                  e.printStackTrace();
              }
              return str;
          }
   
          int [] readintarray(int n) {
              int res [] = new int [n];
              for(int i = 0; i<n; i++)res[i] = nextInt();
              return res;
          }
          long [] readlongarray(int n) {
              long res [] = new long [n];
              for(int i = 0; i<n; i++)res[i] = nextLong();
              return res;
          }
      }
   
  }
   
   