#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
#define int ll

const int N = 2e5 + 5;
const int mod = 1e9 + 7;

int n, m, cnt[20], cnt2[20], dp[10][10][N], kol[20];

void solve() {
    cin >> n >> m;
    while (n) {
        ++kol[(n % 10)];
        n /= 10;
    }
    int ans = 0;
    for (int i = 0; i <= 9; ++i) {
        ans += dp[i][kol[i]][m];
        kol[i] = 0;
    }
    cout << ans <<"\n";
}

 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	for (int num = 0; num <= 9; ++num) {
        for (int c = 1; c <= 9; ++c) {
            for (int i = 0; i <= 9; ++i) { cnt[i] = 0; }
            cnt[num] = c;

            for (int i = 1; i <= N-5; ++i) {
                for (int j = 0; j <= 8; ++j) {
                    cnt2[j+1] = cnt[j];
                }
                cnt2[0] += cnt[9]; if (cnt2[0] >= mod) { cnt2[0] -= mod; }
                cnt2[1] += cnt[9]; if (cnt2[1] >= mod) { cnt2[1] -= mod; }
                for (int j = 0; j <= 9; ++j) {
                    cnt[j] = cnt2[j];
                    cnt2[j] = 0;
                }

                int res = 0;
                for (int j = 0; j <= 9; ++j) {
                    res += cnt[j];
                    if (res >= mod) { res -= mod; }
                }
                dp[num][c][i] = res;
            }
        }
	}

	int tests = 1;
	cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/
