#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")

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

constexpr int mod = 1e9 + 7, N = 1000 + 10, M = 9000 + 10;
namespace basic {
  inline int add(int x, int y) {return (x + y >= mod ? x + y - mod : x + y);}
  inline int dec(int x, int y) {return (x - y < 0 ? x - y + mod : x - y);}
  inline void ad(int &x, int y) {x = add(x, y);}
  inline void de(int &x, int y) {x = dec(x, y);}

  inline int qpow(int a, int b) {
    int r = 1;
    while(b) {
      if(b & 1) r = 1ll * r * a % mod;
      a = 1ll * a * a % mod; b >>= 1;
    }
    return r;
  }
  inline int inv(int x) {return qpow(x, mod - 2);}

  int fac[N], ifac[N];
  inline void fac_init(int n = N - 1) {
    fac[0] = 1;
    for(int i = 1; i <= n; i++)
      fac[i] = 1ll * fac[i - 1] * i % mod;
    ifac[n] = inv(fac[n]);
    for(int i = n - 1; i >= 0; i--)
      ifac[i] = 1ll * ifac[i + 1] * (i + 1) % mod;
  }
  int invx[N];
  inline void inv_init(int n = N - 1) {
    invx[1] = 1;
    for(int i = 2; i <= n; i++)
      invx[i] = 1ll * (mod - mod / i) * invx[mod % i] % mod;
  }
  inline int binom(int n, int m) {
    if(n < m || m < 0) return 0;
    return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
  }
}
using namespace basic;

int a[N], f[N][M]; bool vis[N][M];

inline int dfs(int dep, bool diff, int s) {
  if(dep == -1) {
    return (s == 0);
  }
  if(s > (dep + 1) * 9) {
    return 0;
  }
  if(diff == 0) {
    int ret = 0;
    for(int i = 0; i <= a[dep] && i <= s; i++) {
      ad(ret, dfs(dep - 1, i != a[dep], s - i));
    }
    return ret;
  }
  int &ans = f[dep][s];
  if(vis[dep][s]) {
    return ans;
  }
  vis[dep][s] = 1, ans = 0;
  for(int i = 0; i < 10 && i <= s; i++) {
    ad(ans, dfs(dep - 1, 1, s - i));
  }
  return ans;
}
inline int calc(int x) {
  int r = 0;
  while(x) {
    r += x % 10;
    x /= 10;
  }
  return r;
}
inline int g(int x, int k) {
  while(x >= 10 && k) {
    x = calc(x);
    k--;
  }
  return x;
}
void Main() {
  string n; cin >> n;
  for(int i = n.size() - 1, j = 0; i >= 0; i--, j++) {
    a[j] = n[i] - '0';
  }
  for(int i = 0; i < n.size(); i++) {
    for(int j = 0; j <= (i + 1) * 9; j++) {
      vis[i][j] = 0;
    }
  }
  int k, m; cin >> k >> m; k--;
  int ans = 0;
  for(int s = 1; s <= n.size() * 9; s++) {
    if(g(s, k) == m) {
      int r = dfs(n.size() - 1, 0, s);
      ad(ans, r);
    }
  }
  cout << ans << "\n";
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  
  int T; cin >> T;
  while(T--) {
    Main();
  }
}