asdasdas

#include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
#include <cmath>
#include <string>

#define mod 1000000007

using namespace std;

long long sum(long long n, long long m) {
    map<int, int> bruh;
    map<int, int> res;
    string s1 = to_string(n);
    int q = s1.size();
    for(int i = 0; i < q; i++) {
        int swap = s1[i] - '0';
        bruh[swap]++;
    }
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < 10; j++) {
            if(j != 9) {
                res[j + 1] = bruh[j];
            } else {
                int vai = bruh[j];
                res[1] = (res[1] + vai) % mod;
                res[0] = (res[0] + vai) % mod;
            }
        }
        for(int j = 0; j < 10; j++) {
            bruh[j] = res[j];
            res[j] = 0;
        }
    }
    int sum = 0;
    for(int i = 0; i < 10; i++) {
        sum = (sum + bruh[i]) % mod;
    }
    return sum;
}

int main() {
    int t;
    long long n, m;
    scanf("%d", &t);
    while(t--) {
        scanf("%lld %lld", &n, &m);
        long long res = sum(n, m);
        printf("%d\n", res);
    }
    return 0;
}