#define Troy 

#include <bits/stdc++.h>

using namespace std;

inline int read(){

    int s=,k=;char ch=getchar();

    while(ch<''|ch>'')    ch=='-'?k=-:,ch=getchar();

    while(ch>&ch<='')    s=s*+(ch^),ch=getchar();

    return s*k;

}

const int N=,mod=;

int n,k,p,BGM,stk[N],m;

struct Matrix{

    int a[N][N];

    Matrix(){memset(a,,sizeof(a));}

    inline void evoid(){

        for(int i=;i^m;++i)

            a[i][i]=;

    }

    inline friend Matrix operator *(const Matrix &x,const Matrix &y){

        Matrix c;

        for(int i=;i^m;++i)

            for(int j=;j^m;++j)

                for(int k=;k^m;++k)

                    c.a[i][j]=(c.a[i][j]+x.a[i][k]*y.a[k][j]%mod)%mod;

        return c;

    }

    inline friend Matrix operator ^(Matrix x,int b){

        Matrix ret;ret.evoid();

        while(b){

            if(b&)ret=ret*x;

            b>>=;x=x*x;

        }return ret;

    }

};

inline bool move_to(int to,int from){

    from^=<<p-;

    from<<=;

    int deta=from^to;

    return (deta&(-deta))==deta;

}

int main(){

    n=read(),k=read(),p=read();

    register int i,j;

    for(i=(<<p-);i^(<<p);++i){

        int x=i;

        for(j=;x;x^=(x&(-x)),++j);

        if(j==k){

            if(i==(<<p)-(<<p-k))

                BGM=m;

            stk[m++]=i;

        }

    }

    Matrix ans,t;

    ans.a[BGM][]=;

    for(i=;i^m;++i)

        for(j=;j^m;++j){

                t.a[i][j]=move_to(stk[j],stk[i]);

        }

    ans=(t^(n-k))*ans;

    printf("%d\n",ans.a[BGM][]);

}