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.
import java.io.*;
import java.util.*;

public class c {
	
	
	public static void main(String args[]) throws IOException {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int t = in.nextInt();
		int max = (int)(2e5 + 1);
		
		dp = new long[10][max];
		
		for (long[] x: dp)
			Arrays.fill(x, -1);
		
		for (int i = 0; i < 10; i++)
			for (int j = 0; j < max; j++)
				memo(i, j);
				
		for ( ; t > 0; t--) {
			char[] line = in.next().toCharArray();
			long ans = 0;
			int m = in.nextInt();
			for (int i = 0; i < line.length; i++) {
				ans = (ans + dp[line[i] - '0'][m]) % mod;
			}
			out.println(ans);
		}
		out.close();
	}
	
	public static long[][] dp;
	public static long mod = (int)(1e9) + 7;
	
	public static long memo(int i, int j) {
		if (dp[i][j] != -1)
			return dp[i][j];
		long ans = 0;
		if (j == 0) {
			ans = 1;
		}
		else if (i == 9) {
			ans = memo(1, j - 1) + memo(0, j - 1);
		}
		else {
			ans = memo(i + 1, j - 1);
		}
		return dp[i][j] = (ans % mod);
	}
	
	
	
	static class FastScanner {
	    BufferedReader br;
	    StringTokenizer st;
		
	    public FastScanner(InputStream i) {
	        br = new BufferedReader(new InputStreamReader(i));
	        st = new StringTokenizer("");
	    }
				
	    public String next() throws IOException {
	        if(st.hasMoreTokens())
	            return st.nextToken();
	        else
	            st = new StringTokenizer(br.readLine());
	        return next();
	    }

	    public int nextInt() throws IOException {
	        return Integer.parseInt(next());
	    }
	    //#
	    public long nextLong() throws IOException {
	        return Long.parseLong(next());
	    }
	    public double nextDouble() throws IOException {
	        return Double.parseDouble(next());
	    }
	    //$
	}
}
