#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
inline long long input() {
  long long n;
  cin >> n;
  return n;
}
long long poww(long long a, long long b, long long md) {
  return (!b ? 1
             : (b & 1 ? a * poww(a * a % md, b / 2, md) % md
                      : poww(a * a % md, b / 2, md) % md));
}
const int MAXN = 1024;
const int MAXLG = 18;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const long long INF = 8e18;
vector<int> adj[10];
long long dp[MAXN][MAXN];
vector<pair<int, int> > edge;
long long ans;
int n, m, k;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> m >> k;
  int a, b;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
    edge.push_back({a, b});
  }
  int tmp;
  for (int i = 0; i < edge.size(); i++) {
    tmp = (1 << edge[i].first) + (1 << edge[i].second);
    dp[tmp][tmp] = 1;
  }
  int lim = (1 << n);
  for (int mask = 0; mask < lim; mask++) {
    if (__builtin_popcount(mask) <= 2) continue;
    for (int l = 0; l <= mask; l++) {
      if (__builtin_popcount(l) <= 1) continue;
      if ((l & mask) != l) continue;
      long long v = __builtin_ctz(l);
      for (auto u : adj[v]) {
        if (!(mask & (1 << u))) continue;
        if (l & (1 << u)) continue;
        dp[mask][l] += dp[mask - (1 << v)][l - (1 << v)] +
                       dp[mask - (1 << v)][l - (1 << v) + (1 << u)];
      }
    }
  }
  for (int i = 0; i < lim; i++) {
    if (__builtin_popcount(i) == k) {
      ans += dp[lim - 1][i];
    }
  }
  cout << ans << "\n";
}
