#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include <bits/stdc++.h>
const int N = 1e3 + 5;
const int M = 9e3 + 5;
const int P = 1e9 + 7;
int T, n, k, m, op[M], t[M], f[N][M];
char s[N];
inline int read()
{
    int w = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        w = w * 10 + (ch - 48);
        ch = getchar();
    }
    return w;
}

inline void Add(int &x, int y) { x += y; if (x >= P) x -= P; }

inline int dfs(int p, int lim, int sum)
{
    if (!lim && f[p][sum] != -1) return f[p][sum];
    if (p > n) return t[sum];
    int up = (lim ? s[p] - '0' : 9), res = 0;
    for (register int i = 0; i <= up; i++) Add(res, dfs(p + 1, lim && (i == (s[p] - '0')), sum + i));
    if (!lim) return f[p][sum] = res;
    return res; 
}

inline int calc(int x)
{
    int cnt = 0;
    while (x)
    {
        cnt += (x % 10);
        x /= 10;
    }
    return cnt;
}

signed main()
{
    T = read();
    while (T--)
    {
        memset(t, 0, sizeof(t));
        memset(f, -1, sizeof(f));
        scanf("%s", s + 1); k = read(), m = read(); n = strlen(s + 1);
        if (m > 9000) { printf("0\n"); continue; }
        if (k >= 2 && m > 36) { printf("0\n"); continue; } 
        int kel = 0;
        for (int i = 0; i <= 9000; i++)
        {
            int x = i;
            for (int j = 1; j < k; j++)
            {
                x = calc(x);
                if (x < 10) break;
            }
            if (x == m) t[i] = 1;
        }
        printf("%lld\n", dfs(1, 1, 0));
    }
   
    return 0;
}