设 f [ i ] [ j ] [ k ] [ l ] f[i][j][k][l] f[i][j][k][l]表示前 i i i个位置,已经放了 1 − j 1-j 1−j的值, j j j有 k k k个间隔需要继续填,可以形成 l l l个数列
每次枚举下一个值放几个
p
p
p
那么新的数列的方案数由插板法的
(
p
−
1
k
−
1
)
∗
l
{p-1\choose k-1}*l
(k−1p−1)∗l
复杂度
O
(
n
5
)
O(n^5)
O(n5)
但是由于实际
l
l
l有用状态很少跑的挺快的
#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<20|1;
inline char gc(){
static char ibuf[RLEN],*ib,*ob;
(ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
return (ib==ob)?EOF:*ib++;
}
inline int read(){
char ch=gc();
int res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline ll readll(){
char ch=gc();
ll res=0;bool f=1;
while(!isdigit(ch))f^=ch=='-',ch=gc();
while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
return f?res:-res;
}
inline int readstring(char *s){
int top=0;char ch=gc();
while(isspace(ch))ch=gc();
while(!isspace(ch)&&ch!=EOF)s[++top]=ch,ch=gc();
return top;
}
template<class tp>inline void chemx(tp &a,tp b){a<b?a=b:0;}
template<class tp>inline void chemn(tp &a,tp b){a>b?a=b:0;}
cs int mod=1e9+7;
inline int add(int a,int b){return (a+=b)>=mod?(a-mod):a;}
inline int dec(int a,int b){a-=b;return a+(a>>31&mod);}
inline int mul(int a,int b){static ll r;r=1ll*a*b;return (r>=mod)?(r%mod):r;}
inline void Add(int &a,int b){(a+=b)>=mod?(a-=mod):0;}
inline void Dec(int &a,int b){a-=b,a+=a>>31&mod;}
inline void Mul(int &a,int b){static ll r;r=1ll*a*b;a=(r>=mod)?(r%mod):r;}
inline int ksm(int a,int b,int res=1){if(a==0&&b==0)return 0;for(;b;b>>=1,Mul(a,a))(b&1)&&(Mul(res,a),1);return res;}
inline int Inv(int x){return ksm(x,mod-2);}
inline int fix(int x){return (x<0)?x+mod:x;}
cs int N=105;
int f[2][N][N][N],c[N][N];
int n,m,K;
int main(){
#ifdef Stargazer
freopen("lx.in","r",stdin);
#endif
n=read(),m=read(),K=read();
for(int i=0;i<N;i++){
c[i][0]=c[i][i]=1;
for(int j=1;j<i;j++)
c[i][j]=add(c[i-1][j],c[i-1][j-1]);
}
int cur=0,res=0;
for(int i=1;i<=m;i++){
cur^=1;
memset(f[cur],0,sizeof(f[cur]));
for(int j=1;j<=n;j++)
for(int k=1;k<=j;k++)
for(int l=1;l<=K;l++)if(f[cur^1][j][k][l]){
int now=f[cur^1][j][k][l];
for(int p=k;j+p<=n&&l*c[p-1][k-1]<=K;p++){
Add(f[cur][j+p][p-k][l*c[p-1][k-1]],now);
}
}
for(int j=1;j<=n;j++)Add(f[cur][j][j][1],1);
for(int j=1;j<=n;j++)
for(int k=1;k<=K;k++)
Add(res,f[cur][j][0][k]);
}
cout<<res<<'\n';
}