Add One , dp

import java.util.Scanner;

public class dp {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        int mod = 1000000007, max_m = 200005;
        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 - 9] + dp[i - 10]) % mod;

        }
        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int res = 0;
            while (n > 0) {
                int dig = n % 10;
                res += (m + dig) < 10 ? 1 : dp[m - (10 - dig)];
                res %= mod;
                n /= 10;
            }
            System.out.println(res);
        }
    }
}