#include <algorithm>

#include  <iterator>

#include  <iostream>

#include   <cstring>

#include   <cstdlib>

#include   <iomanip>

#include    <bitset>

#include    <cctype>

#include    <cstdio>

#include    <string>

#include    <vector>

#include     <stack>

#include     <cmath>

#include     <queue>

#include      <list>

#include       <map>

#include       <set>

#include   <cassert>

using namespace std;

#define lson (l , mid , rt << 1)

#define rson (mid + 1 , r , rt << 1 | 1)

#define debug(x) cerr << #x << " = " << x << "\n";

#define pb push_back

#define pq priority_queue

typedef long long ll;

typedef unsigned long long ull;

//typedef __int128 bll;

typedef pair<ll ,ll > pll;

typedef pair<int ,int > pii;

typedef pair<int,pii> p3;

//priority_queue<int> q;//这是一个大根堆q

//priority_queue<int,vector<int>,greater<int> >q;//这是一个小根堆q

#define fi first

#define se second

//#define endl '\n'

#define OKC ios::sync_with_stdio(false);cin.tie(0)

#define FT(A,B,C) for(int A=B;A <= C;++A)  //用来压行

#define REP(i , j , k)  for(int i = j ; i <  k ; ++i)

#define max3(a,b,c) max(max(a,b), c);

#define min3(a,b,c) min(min(a,b), c);

//priority_queue<int ,vector<int>, greater<int> >que;

const ll mos = 0x7FFFFFFF;  //

const ll nmos = 0x80000000;  //-2147483648

const int inf = 0x3f3f3f3f;

const ll inff = 0x3f3f3f3f3f3f3f3f; //

const int mod = ;

const double esp = 1e-;

const double PI=acos(-1.0);

const double PHI=0.61803399;    //黄金分割点

const double tPHI=0.38196601;

template<typename T>

inline T read(T&x){

    x=;int f=;char ch=getchar();

    while (ch<''||ch>'') f|=(ch=='-'),ch=getchar();

    while (ch>=''&&ch<='') x=x*+ch-'',ch=getchar();

    return x=f?-x:x;

}

/*-----------------------showtime----------------------*/

            const int maxn = ;

            ll n,m,k;

            struct matrix

            {

                ll a[maxn][maxn];

                matrix(){

                    memset(a, , sizeof(a));

                }

            }mp;

            int ji[maxn];

            matrix mul(matrix A, matrix B){

                int l = ( << m) - ;

                matrix res;

                for(int i=; i<=l; i++){

                    for(int j=; j<=l; j++){

                        for(int k=; k <= l; k++)

                            res.a[i][j] = (res.a[i][j] + A.a[i][k] * B.a[k][j] % mod)%mod;

                    }

                }

                return res;

            }

            matrix ksm(matrix A, ll n){

                matrix res;

                int l = ( << m) - ;

                for(int i=; i<=l; i++) res.a[i][i] = ;

                while(n > ){

                    if(n & ) res = mul(res, A);

                    A = mul(A, A);

                    n >>= ;

                }

                return res;

            }

int main(){

            cin>>n>>m>>k;

            for(int i=; i<(<<m); i++) ji[i] = __builtin_popcount(i);

            for(int i=; i<(<<m); i++) if(ji[i] <= k){

                int t1 = (i>>) | ( << (m-));

                int t2 = (i>>);

                if(ji[t1] <= k) mp.a[i][t1] = ;

                mp.a[i][t2] = ;

            }

            mp = ksm(mp, n);

            ll ans = ;

            for(int i=; i<(<<m); i++){

                ans = (ans + mp.a[i][i]) % mod;

            }

            cout<<ans<<endl;

            return ;

}