#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,M,K; cin >> N >> M >> K;
    vector<vector<int>> dist(N,vector<int>(N,K+1));
    for(int i=0; i<N; i++) dist.at(i).at(i) = 0;
    while(M--){
        int a,b; cin >> a >> b; a--,b--;
        dist.at(a).at(b) = 1,dist.at(b).at(a) = 1;
    }
    for(int i=0; i<N; i++) for(int k=0; k<N; k++) for(int l=0; l<N; l++) dist.at(k).at(l) = min(dist.at(k).at(l),dist.at(k).at(i)+dist.at(i).at(l));

    vector<int> P;
    long long answer = 0;
    for(int d=N-1; d>0; d--){
        if(P.size() == K) break;
        P.push_back(d);
        int n = P.size(),n2 = 1<<n;;
        vector<vector<int>> dp(n2,vector<int>(n,K+1));
        for(int i=0; i<n; i++) dp.at(1<<i).at(i) = dist.at(0).at(P.at(i));
        for(int i=3; i<n2; i++){
            for(int k=0; k<n; k++) if(i&(1<<k)) for(int l=0; l<n; l++) if(k != l && (i&(1<<l))){
                dp.at(i).at(k) = min(dp.at(i).at(k),dp.at(i-(1<<k)).at(l)+dist.at(P.at(l)).at(P.at(k)));
            }
        }
        if(*min_element(dp.back().begin(),dp.back().end()) <= K) answer += (1LL<<d)-1;
        else P.pop_back();
    }
    cout << answer << endl;
}