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.*;

public class AddOne {
    
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter log = new BufferedWriter(new OutputStreamWriter(System.out));
        int t = Integer.parseInt(br.readLine());
        int max_n = 200005;
        int mod = 1000000007;
        int[] dp = new int[max_n];
        for (int i = 0; i < 9; i++) {
            dp[i] = 2;
        }
        dp[9] = 3;
        for (int j = 10; j < max_n; j++) {
            dp[j] = (dp[j - 9] + dp[j - 10]) % mod;
        }

        while (t-- > 0){
            String[] s = br.readLine().split(" ");
            int n = Integer.parseInt(s[0]);
            int m = Integer.parseInt(s[1]);
            int cnt = 0;
            while (n > 0) {
                int x = n % 10;
                cnt += ((m + x < 10) ? 1 : dp[m + x - 10]);
                cnt %= mod;
                n /= 10;
            }
            log.write(cnt + "\n");;
            log.flush();
        }
    }

}
