// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int MOD = 1e9 + 7;
inline void add(int &x, ll y) {x = (x + y) % MOD;}
// const 
string st;
int k, m;
int dp[1010][10010][2];
int calc(int x) {
	int w = 0;
	while (x) {
		w += x % 10;
		x /= 10;
	}
	return w;
}
void zhk() {
	cin >> st >> k >> m;
	int n = st.size(); st = ' ' + st;
	ms(dp, 0);
	dp[0][0][0] = 1;
	F(i, 1, n) {
		int num = st[i] - '0';
		F(j, 0, (i - 1) * 9) {
			if (dp[i - 1][j][0]) {
				F(t, 0, num - 1) add(dp[i][j + t][1], dp[i - 1][j][0]);
				add(dp[i][j + num][0], dp[i - 1][j][0]);
			}
			if (dp[i - 1][j][1]) {
				F(t, 0, 9) add(dp[i][j + t][1], dp[i - 1][j][1]);
			}
		}
	}
	int s = 0;
	F(i, 0, n * 9) {
		int w = (dp[n][i][0] + dp[n][i][1]) % MOD, t = i;
		// debug << i << ' ' << w << '\n';
		F(j, 2, k) {
			t = calc(t);
			if (t < 10) break;
		}
		if (t == m) add(s, w);
	}
	cout << s << '\n';
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/