#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define int long long

using namespace std;

int calc(int x, int y)
{
    if (!y) {
        return x;
    }
    if (y > 100) {
        return (x % 9 == 0 ? 9 : x % 9);
    }
    int A = 0;
    while (x) {
        A += x % 10;
        x = x / 10;
    }
    return calc(A, y - 1);
}

const int P = 1e9 + 7;

int f[1005][2][9005];

signed main()
{
    int T;
    scanf("%lld", &T);
    while (T--) {
        string n;
        cin >> n;
        n = ' ' + n;
        memset(f, 0, sizeof(f));
        f[0][1][0] = 1;
        for (int i = 1; i < (int)n.size(); ++i) {
            for (int j = 0; j <= i * 9; ++j) {
                if (j >= n[i] - '0') f[i][1][j] = f[i - 1][1][j - (n[i] - '0')];
                for (int k = 0; k <= 9 && k <= j; ++k) {
                    ((f[i][0][j] += f[i - 1][0][j - k]) >= P) && (f[i][0][j] -= P);
                    if (k < n[i] - '0') {
                        ((f[i][0][j] += f[i - 1][1][j - k]) >= P) && (f[i][0][j] -= P);
                    }
                }
            }
        }
        int k, m, A = 0;
        scanf("%lld%lld", &k, &m);
        for (int i = 1; i <= (int)(n.size() - 1) * 9; ++i) {
            if (calc(i, k - 1) == m) {
                A = (0ll + A + f[(int)n.size() - 1][0][i] + f[(int)n.size() - 1][1][i]) % P;
            }
        }
        printf("%lld\n", A);
    }
    return 0;
}