#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define all(x) x.begin(), x.end()
const int N = 9999 + 10;
int bad[N];
int mod = 1e9 + 7;
// k>=1
void change(int &x)
{
    int y = 0;
    while (x)
    {
        y += x % 10;
        x /= 10;
    }
    swap(x, y);
}
void make_bad(i64 n, i64 k)
{
    for (int i = 0; i <= 9999; i++)
    {
        bad[i] = 0;
        int x = i;
        for (int j = 0; x >= 10 && j < k - 1; j++)
            change(x);
        if (x == n)
            bad[i] = 1;
    }
}
/*
1
114 1 5
*/
int dp[1000][N];
int dfs(string &s, int n, int sum, int flag)
{
    if (n == 0)
    {
        return bad[sum];
    }
    if (~dp[n][sum])
        return dp[n][sum];
    dp[n][sum] = 0;
    int hi = flag ? s[n - 1] - '0' : 9;
    for (int lo = 0; lo <= hi; lo++)
    {
        dp[n][sum] += dfs(s, n - 1, sum + lo, (flag) && (lo == hi));
        dp[n][sum] %= mod;
    }
    return dp[n][sum];
}
void solve()
{
    memset(dp, -1, sizeof dp);
    string s;
    cin >> s;
    int n, k;
    cin >> k >> n;
    make_bad(n, k);
    //(g,n,k)<=1e6
    reverse(all(s));
    // 状态数位和[1000][9999],1e8种状态
    i64 res = dfs(s, s.size(), 0, true);

 
    res = (res + mod) % mod;
    cout << res << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
}