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.
//https://codeforces.com/contest/1513/problem/C
//C. Add One
import java.util.*;
import java.io.*;
public class CF_1513_C{
	public static void main(String[] args) throws Exception{
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		int mod = (int)1e9+7;

		int max_m = 200000+5;

		int dp[] = new int[max_m];
		for(int i=0;i<9;i++)
			dp[i] = 2;
		dp[9] = 3;

		for(int i=10;i<max_m;i++){
			dp[i] = (dp[i-10]+dp[i-9])%mod;
		}

		int t = Integer.parseInt(br.readLine());

		while(t-->0){
			st = new StringTokenizer(br.readLine().trim());
			int n = Integer.parseInt(st.nextToken());
			int m = Integer.parseInt(st.nextToken());

			int ans = 0;

			while(n>0){
				int x = n%10;
				if(m+x<10)
					ans += 1;
				else
					ans += dp[x+m-10];
				ans%=mod;
				n/=10;
			}

			sb.append(ans).append("\n");
		}

		pw.print(sb);
		pw.flush();
		pw.close();
	}
}