#include<bits/stdc++.h>

#define reg register int

#define il inline

#define fi first

#define se second

#define mk(a,b) make_pair(a,b)

#define numb (ch^'0')

using namespace std;

typedef long long ll;

template<class T>il void rd(T &x){

    char ch;x=;bool fl=false;

    while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);

    for(x=numb;isdigit(ch=getchar());x=x*+numb);

    (fl==true)&&(x=-x);

}

template<class T>il void output(T x){if(x/)output(x/);putchar(x%+'');}

template<class T>il void ot(T x){if(x<) putchar('-'),x=-x;output(x);putchar(' ');}

template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}

namespace Miracle{

const int N=;

const int mod=;

int n,k,l;

int qm(int x,int y){

    int ret=;

    while(y){

        if(y&) ret=(ll)ret*x%mod;

        x=(ll)x*x%mod;

        y>>=;

    }

    return ret;

}

int ad(int x,int y){

    return x+y>=mod?x+y-mod:x+y;

}

int f[N][N][];

int main(){

    rd(n);rd(k);rd(l);

    f[][][]=;

    for(reg i=;i<=*n+;++i){

        for(reg j=;j<=i;++j){

            for(reg x=;x<=;++x){

                if(i+j+(-x)<=*n+){

                    // cout<<i<<" "<<j<<" "<<x<<endl;

                    f[i][j][x]=ad(f[i][j][x],(ll)f[i-][j+][x]*(j+)%mod);

                    if(j>)f[i][j][x]=ad(f[i][j][x],f[i-][j-][x]);

                    if(x==&&j>=k)f[i][j][x]=ad(f[i][j][x],f[i-][j][]);

                    // cout<<" val "<<f[i][j][x]<<endl;

                }

            }

        }

    }

    // cout<<f[2*n+1][0][1]<<endl;

    ll jie=;

    for(reg i=n+;i<=*n+;++i) jie=(ll)jie*i%mod;

    ll ans=(ll)f[*n+][][]*qm(,n)%mod*qm(jie,mod-)%mod;

    cout<<(ll)ans*l%mod;

    return ;

}

}

signed main(){

    Miracle::main();

    return ;

}

/*

   Author: *Miracle*

   Date: 2019/4/13 19:58:12

*/