#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001

long long N,M,K;

vector<vector<int>> tt;
void check(vector<int> t){
	rep(i,2){
		rep(j,N-1){
			if(t[i*N+j] == t[i*N+j+1])return;
		}
	}
	rep(i,N){
		if(t[i]==t[i+N])return;
	}
	tt.push_back(t);
}

void dfs(vector<int> &t,int cur){
	if(t.size()==N*2){
		check(t);
		return;
	}
	rep(i,cur){
		t.push_back(i);
		dfs(t,cur);
		t.pop_back();
	}
	t.push_back(cur);
	cur++;
	dfs(t,cur);
	t.pop_back();
}

vector<int> trans(vector<int> t){
	map<int,int> used;
	rep(i,t.size()){
		if(used.count(t[i])){
			t[i] = used[t[i]];
		}
		else{
			int tt = used.size();
			used[t[i]] = tt;
			t[i] = tt;
		}
	}
	
	return t;
}

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main(){
	
	
	cin>>N>>M>>K;
	
	{
		vector<int> t;
		
		dfs(t,0);
	}
	
	sort(tt.begin(),tt.end());

	vector<vector<int>> t;
	
	rep(i,tt.size()){
		vector<int> temp;
		rep(j,N){
			temp.push_back(tt[i][j]);
		}
		t.push_back(temp);
	}
	sort(t.begin(),t.end());
	t.erase(unique(t.begin(),t.end()),t.end());

	//cout<<tt.size()<<endl;
	mint ans= 0;
	combi C(400000);
	
	vector<int> A(tt.size()),B(tt.size());
	vector<vector<int>> Minus(tt.size());
	
	rep(j,tt.size()){
		int cnt = 0;
		vector<bool> f(N*2,false);
		vector<int> x,y;
		rep(k,tt[j].size()){
			if(k<N){
				if(f[tt[j][k]]){
					continue;
				}
				else{
					cnt++;
					f[tt[j][k]] = true;
				}
				x.push_back(tt[j][k]);
			}
			else{
				if(f[tt[j][k]]){
					
				}
				else{
					Minus[j].push_back(cnt);
					cnt++;
					f[tt[j][k]] = true;
				}
				y.push_back(tt[j][k]);
			}
		}
		y = trans(y);
		int d0 = distance(t.begin(),lower_bound(t.begin(),t.end(),x));
		int d1 = distance(t.begin(),lower_bound(t.begin(),t.end(),y));
		A[j]= d0;
		B[j] = d1;
	}		
	
	vector<vector<int>> Minus2(t.size());
	rep(j,t.size()){
		int cnt = 0;
		vector<bool> f(N,false);
		rep(k,t[j].size()){
			if(f[t[j][k]]){
				continue;
			}
			else{
				Minus2[j].push_back(cnt);
				cnt++;;
				f[t[j][k]] = true;
			}
		}
		
	}
	M--;
	rep(i,K){
		vector dp(t.size(),vector<mint>(t.size(),0));
		rep(j,tt.size()){
			mint v = 1;
			
			rep(k,Minus[j].size()){
				v *= K-i-Minus[j][k];
			}
			dp[A[j]][B[j]] += v;
		}		
		vector<mint> cur(t.size(),0);
		
		rep(j,t.size()){
			mint v = 1;
			rep(k,Minus2[j].size()){
				v *= K-i-Minus2[j][k];
			}
			cur[j] = v;
		}
		rep(j,60){
			if((M>>j)&1){
				vector<mint> ncur(t.size(),0);
				rep(k,t.size()){
					rep(l,t.size()){
						ncur[l] += cur[k] * dp[k][l];
					}
				}
				swap(cur,ncur);
			}
			vector ndp(t.size(),vector<mint>(t.size(),0));
			rep(k,t.size()){
				rep(l,t.size()){
					rep(m,t.size()){
						ndp[k][l] += dp[k][m] * dp[m][l];
					}
				}
			}
			swap(dp,ndp);
		}
		
		mint sum = 0;
		rep(j,t.size()){
			sum += cur[j];
		}

		sum *= C.combination(K,i);
		if(i%2==1)sum *= -1;
		ans += sum;
		
	}
	cout<<ans.val()<<endl;
	
	
	
	return 0;
}