You are given an integer n. You have to apply m operations to it.

In a single operation, you must replace every digit d of the number with the decimal representation of integer d + 1. For example, 1912 becomes 21023 after applying the operation once.

You have to find the length of n after applying m operations. Since the answer can be very large, print it modulo 10^9+7.

Input

The first line contains a single integer t (1 ≤ t ≤ 2 ⋅ 10^5) — the number of test cases.

The only line of each test case contains two integers n (1 ≤ n ≤ 10^9) and m (1 ≤ m ≤ 2 ⋅ 10^5) — the initial number and the number of operations. 

Output

For each test case output the length of the resulting number modulo 10^9+7.

Example

Input


5
1912 1
5 6
999 1
88 2
12 100


Output


5
2
6
4
2115

Note

For the first test, 1912 becomes 21023 after 1 operation which is of length 5.

For the second test, 5 becomes 21 after 6 operations which is of length 2.

For the third test, 999 becomes 101010 after 1 operation which is of length 6.

For the fourth test, 88 becomes 1010 after 2 operations which is of length 4.
//make sure to make new file!
import java.io.*;
import java.util.*;

public class C714{

   public static long MOD = 1000000007L;
   public static int MAX = 200005;
   
   public static void main(String[] args)throws IOException{
      BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
      PrintWriter out = new PrintWriter(System.out);
      
      int t = Integer.parseInt(f.readLine());
      
      long[][] precalc = new long[10][MAX];
      for(int k = 0; k < 10; k++){
         precalc[k] = calc(k);
      }
      
      
      for(int q = 1; q <= t; q++){
      
         StringTokenizer st = new StringTokenizer(f.readLine());
      
         int n = Integer.parseInt(st.nextToken());
         int m = Integer.parseInt(st.nextToken());
         
         long[] digits = new long[10];
         
         long answer = 0;
         while(n > 0){
            answer = (answer + precalc[n%10][m] + MOD)%MOD;
            n/=10;
         }
         
         out.println(answer);
      }
      
      
      
      
      out.close();
   }
   
   public static long[] calc(int x){
      long[] digits = new long[10];
      digits[x] = 1;
      
      long[] ret = new long[MAX];
      ret[0] = 1;
      for(int k = 1; k < MAX; k++){
         ret[k] = (ret[k-1] + digits[9] + MOD)%MOD;
         shift(digits);
      }
      
      return ret;
   }
   
   public static void shift(long[] digits){
      
      long temp9 = digits[9];
      for(int k = 8; k >= 0; k--){
         digits[k+1] = digits[k];
      }
      digits[0] = temp9;
      digits[1] = (digits[1] + temp9 + MOD)%MOD;
   }
      
}