#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
int n, t, k, inv, a[15], sum[45], H, T, now, S, res, num[45], cnt[15], tem, tt;
map<int, int>f;
struct martix{
	int a[45][45];
	martix(){
		memset(a, 0, sizeof(a));
	}
	inline void init(){
		for(int i = 1; i <= T; i++) a[i][i] = 1;
	}
	inline void print(){
		for(int i = 1; i <= T; i++){
			for(int j = 1; j <= T; j++){
				printf("%lld ", a[i][j]);
			}
			putchar('\n');
		}
	}
}base, ans;
inline int qp(int x, int y){
	int res = 1;
	while(y){
		if(y & 1) res = res * x % mod;
		x = x * x % mod, y >>= 1;
	}
	return res;
}
inline martix operator * (martix x, martix y){
	martix res;
	for(int i = 1; i <= T; i++){
		for(int k = 1; k <= T; k++){
			if(x.a[i][k] == 0) continue ;
			for(int j = 1; j <= T; j++){
				res.a[i][j] += x.a[i][k] * y.a[k][j] % mod;
				res.a[i][j] %= mod;
			}
		}
	}
	return res;
}
inline int calc(int x){
	S = 0; 
	for(int i = 1; x; i++){
		cnt[i] = x % 10;
		S++;
		x /= 10;
	}
	now = 0;
	for(int i = 1; i <= S; i++){
		for(int j = 1; j <= cnt[i]; j++){
			a[++now] = i;
		}
	}
	return S;
}
inline int work(){
	for(int i = 1; i <= 10; i++) sum[i] = 0;
	for(int i = 1; i <= n; i++) sum[a[i]]++;
	int res = 0;
	sort(sum + 1, sum + 11);
	for(int i = 1; i <= 10; i++){
		res = res * 10 + sum[i];
	}
	return res;
}
inline void bfs(){
	for(int i = 1; i <= n; i++) a[i] = i;
	tem = work();
	f[tem] = 1;
	num[T = 1] = tem;
	while(H < T){
		H++;
		calc(num[H]);
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= n; j++){
				tt = a[j];
				a[j] = a[i];
				tem = work();
				if(f[tem] == 0){
					f[tem] = ++T;
					num[T] = tem;
				}
				base.a[H][f[tem]]++;
				a[j] = tt;
			}
		}
	}
}
inline martix ksm(martix x, int y){
	martix res;
	res.init();
	while(y){
		if(y & 1) res = res * x;
		x = x * x, y >>= 1;
	}
	return res;
}
signed main(){
	scanf("%lld%lld%lld", &n, &t, &k);
	inv = qp(n * n, mod - 2);
	bfs();
	for(int i = 1; i <= T; i++) for(int j = 1; j <= T; j++) base.a[i][j] = base.a[i][j] * inv % mod;
	base = ksm(base, t);
	ans.a[1][1] = 1;
	ans = ans * base;
	for(int i = 1; i <= T; i++){
		if(calc(num[i]) >= k){
			res += ans.a[1][i];
			res %= mod;
		}
	}
	printf("%lld", res);
	return 0;
}