Try guessing the statement from this picture <http://tiny.cc/ogyoiz>.

You are given two integers A and B, calculate the number of pairs (a, b) such that 1 ≤ a ≤ A, 1 ≤ b ≤ B, and the equation a ⋅ b + a + b = conc(a, b) is true; conc(a, b) is the concatenation of a and b (for example, conc(12, 23) = 1223, conc(100, 11) = 10011). a and b should not contain leading zeroes.

Input

The first line contains t (1 ≤ t ≤ 100) — the number of test cases.

Each test case contains two integers A and B (1 ≤ A, B ≤ 10^9).

Output

Print one integer — the number of pairs (a, b) such that 1 ≤ a ≤ A, 1 ≤ b ≤ B, and the equation a ⋅ b + a + b = conc(a, b) is true.

Example

Input


3
1 11
4 2
191 31415926


Output


1
0
1337

Note

There is only one suitable pair in the first test case: a = 1, b = 9 (1 + 9 + 1 ⋅ 9 = 19).
import java.io.*;
import java.util.*;
/**
  * Built using my Brain
  * Actual solution is at the bottom
  *
  * @author Lenard Hoffstader
*/

public class cfjava
{
  public static void main(String[] args)
  {
    OutputStream outputStream = System.out;
    FastReader in = new FastReader();
    PrintWriter out = new PrintWriter(outputStream);
    PROBLEM solver = new PROBLEM();
    int t=1;
    t=in.nextInt();
    for(int i=0;i<t;i++){
      solver.solve(in, out);
    }
    out.close();
  }

  static class PROBLEM
  {
    public void solve(FastReader in,PrintWriter out)
    {
      long a=in.nextLong(),b=in.nextLong();
      long n=0;
      for(int i=1;i<=10;i++){
        long x = (long)Math.pow(10,i)-1;
        if(x<=b)n++;
      }
      long ans = a*n;
      out.println(ans);
    }
  }
  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());}

    boolean nextBoolean(){
      if(nextInt()==1)return true;
      else return false;
    }
    // boolean nextBoolean(){return Boolean.parseBoolean(next());}

    String nextLine() 
    { 
      String str = ""; 
      try
      { 
        str = br.readLine(); 
      } 
      catch (IOException e){e.printStackTrace();} 
      return str; 
    } 
  }
}