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: /*package whatever //do not write package name here
  JAIKARA SHERAWALI DA BOl SACHE DARBAR KI JAI 
  JAI BHOLENAATH HAR HAR MAHADEV
  Rohit Kumar
  NIT JAMSHEDPUR
  */
  import java.util.*;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.Scanner;
  import java.util.StringTokenizer;
  import java.util.TreeMap;
  import java.util.TreeSet;
  
  public class Main {
      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;
          }
      }
  
      static int getIndex(int i, int N) {
          i = i % N;
          i = (i + N) % N;
          return i;
      }
  
      static int getDist(int i, int j, int N) {
          int dist, swap;
          if (i > j) {
              swap = i;
              i = j;
              j = swap;
          }
          dist = j - i;
          int x = N - j - 1;
          dist = Math.min(dist, x + i+1);
          return dist;
      }
     void sieveOfEratosthenes(int n)
      {
          boolean prime[] = new boolean[n+1];
          for(int i=0;i<=n;i++)
              prime[i] = true;
           
          for(int p = 2; p*p <=n; p++)
          {
              if(prime[p] == true)
              {
                  for(int i = p*p; i <= n; i += p)
                      prime[i] = false;
              }
          }
          for(int i = 2; i <= n; i++)
          {
              if(prime[i] == true)
                  System.out.print(i + " ");
          }
      }
      static long gcd(long a,long b)
      {
          if(b==0) return a;
          
          return gcd(b,a%b);
      }
      static boolean isprime(int n)
      {
          if(n<=1)
           return false;
          
          if(n<=3)
           return true;
          
          if(n%2==0||n%3==0)
           return false;
          
          for(int i=5;i*i<=n;i=i+6)
          {
              if(n%i==0||n%(i+2)==0)
                return false;
          }
          return true;
      }
     static long modPow(long x, long y)
       {
        if (y == 0)
          return 1;
         long p = modPow(x, y / 2);
         return p * p * (y % 2 > 0 ? x : 1) % 1000000007;
       }
       static long pow(long a,long b) {
  		if(b<0) return 1;
  		long res=1;
  		while(b!=0) {
  			if((b&1)!=0) {
  				res*=a;
  				res%=mod;
  			}
  			a*=a;
  			a%=mod;
  			b=b>>1;
  		}
  		return res;
  	}
  	static int mod=1000000007;
      public static void main(String[] args) {
          FastReader sc= new FastReader();
          int t = sc.nextInt();
          while (t-->0){
            int n=sc.nextInt();
            int k=sc.nextInt();
            long ans=0;
            
            int j=0;
            char ch[]=Integer.toBinaryString(k).toCharArray();
            for(int i=ch.length-1;i>=0;i--)
            {
                if(ch[i]=='1'){
                 ans+=pow(n,j);
                 ans%=mod;
                }
                 j++;
            }
            System.out.println(ans);
          }
      }
  }
              