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

bool check(vector<vector<int>> &E,vector<int> t){
	vector<int> ind(N,-1);
	rep(i,t.size()){
		ind[t[i]] = i;
	}
	
	int n = t.size();
	
	vector dis(1<<n,vector<int>(N,Inf));
	dis[0][0] = 0;
	queue<pair<int,int>> Q;
	Q.emplace(0,0);
	
	while(Q.size()>0){
		int x = Q.front().first,y = Q.front().second;
		Q.pop();
		rep(i,E[y].size()){
			int ny = E[y][i];
			int nx = x;
			if(ind[ny]!=-1)nx |= 1<<(ind[ny]);
			if(dis[nx][ny]==Inf){
				dis[nx][ny] = dis[x][y]+1;
				Q.emplace(nx,ny);
			}
		}
	}
	
	int ret = Inf;
	rep(i,N)ret = min(ret,dis.back()[i]);
	return ret <= K;
	
}

int main(){
	
	
	cin>>N>>M>>K;
	
	vector<vector<int>> E(N);
	rep(i,M){
		int u,v;
		cin>>u>>v;
		u--;v--;
		E[u].push_back(v);
		E[v].push_back(u);
	}
	
	vector<int> cur;
	for(int i=N-1;i>=0;i--){
		auto temp = cur;
		temp.push_back(i);
		if(check(E,temp)){
			
		}
		else{
			temp.pop_back();
		}
		swap(cur,temp);
	}
	
	long long ans = 0LL;
	rep(i,cur.size()){
		ans += (1LL<<cur[i])-1LL;
	}
	cout<<ans<<endl;
	
	return 0;
}