#include <bits/stdc++.h>
using namespace std;

bool Memory_begin;

/*
 */

template <int mod>
unsigned int down(unsigned int x)
{
    return x >= mod ? x - mod : x;
}
template <int mod>
struct Modint
{
    unsigned int x;
    Modint() = default;
    Modint(unsigned int x) : x(x) {}
    friend istream &operator>>(istream &in, Modint &a) { return in >> a.x; }
    friend ostream &operator<<(ostream &out, Modint a) { return out << a.x; }
    friend Modint operator+(Modint a, Modint b) { return down<mod>(a.x + b.x); }
    friend Modint operator-(Modint a, Modint b) { return down<mod>(a.x - b.x + mod); }
    friend Modint operator*(Modint a, Modint b) { return 1ULL * a.x * b.x % mod; }
    friend Modint operator/(Modint a, Modint b) { return a * ~b; }
    friend Modint operator^(Modint a, int b)
    {
        Modint ans = 1;
        for (; b; b >>= 1, a *= a)
            if (b & 1)
                ans *= a;
        return ans;
    }
    friend Modint operator~(Modint a) { return a ^ (mod - 2); }
    friend Modint operator-(Modint a) { return down<mod>(mod - a.x); }
    friend Modint &operator+=(Modint &a, Modint b) { return a = a + b; }
    friend Modint &operator-=(Modint &a, Modint b) { return a = a - b; }
    friend Modint &operator*=(Modint &a, Modint b) { return a = a * b; }
    friend Modint &operator/=(Modint &a, Modint b) { return a = a / b; }
    friend Modint &operator^=(Modint &a, int b) { return a = a ^ b; }
    friend Modint &operator++(Modint &a) { return a += 1; }
    friend Modint operator++(Modint &a, int)
    {
        Modint x = a;
        a += 1;
        return x;
    }
    friend Modint &operator--(Modint &a) { return a -= 1; }
    friend Modint operator--(Modint &a, int)
    {
        Modint x = a;
        a -= 1;
        return x;
    }
    friend bool operator==(Modint a, Modint b) { return a.x == b.x; }
    friend bool operator!=(Modint a, Modint b) { return !(a == b); }
};
const int mod = 1e9 + 7;
typedef Modint<mod> mint;

bool Memory_end;

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

    cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        string n;
        int m, k, len;
        cin >> n >> k >> m;
        len = n.length();
        if (m > 9 * len)
        {
            cout << 0 << '\n';
            continue;
        }
        vector dp(len + 1, vector<mint>(9 * len + 1));
        dp[0][0] = 1;
        for (int i = 1; i <= len; i++)
            for (int j = 0; j < 10; j++)
                for (int k = 0; k + j <= 9 * len; k++)
                    dp[i][k + j] += dp[i - 1][k];
        vector<int> ok, f(9 * len + 1);
        for (int i = 1; i <= 9 * len; i++)
            f[i] = i;
        for (int j = 2; j <= k and j <= 100; j++)
        {
            for (int i = 1; i <= 9 * len; i++)
            {
                int tmp = f[i];
                f[i] = 0;
                while (tmp)
                {
                    f[i] += tmp % 10;
                    tmp /= 10;
                }
            }
        }
        for (int i = 1; i <= 9 * len; i++)
            if (f[i] == m)
                ok.push_back(i);

        mint ans = 0;
        int sum = 0;
        for (int i = 0; i < len; i++)
        {
            for (int j = 0; j < n[i] - '0'; j++)
            {
                int cur = sum + j;
                for (int x : ok)
                    if (x >= cur)
                        ans += dp[len - i - 1][x - cur];
            }
            sum += n[i] - '0';
        }
        for (int x : ok)
            if (x >= sum)
                ans += dp[0][x - sum];
        cout << ans << '\n';
    }
}
/*
 */