#include <bits/stdc++.h>
using namespace std;
vector<int> adj[20];
long long dp[(1 << 11)][(1 << 11)];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
    dp[(1 << x) ^ (1 << y)][(1 << x) ^ (1 << y)] = 1;
  }
  dp[0][0] = 1;
  for (int i = 0; i < n; i++) {
    dp[1 << i][1 << i] = 1;
  }
  long long ans = 0;
  for (int mask1 = 1; mask1 < (1 << n); mask1++) {
    for (int mask2 = mask1; mask2; (--mask2) &= mask1) {
      if ((__builtin_popcount(mask2) <= 1) ||
          (__builtin_popcount(mask1) <= 2) || (mask1 == mask2))
        continue;
      int u = __builtin_ctz(mask2);
      int l = 0;
      for (int v : adj[u]) {
        if (mask1 & (1 << v)) {
          if (!(mask2 & (1 << v))) {
            dp[mask1][mask2] +=
                dp[mask1 ^ (1 << u)][mask2 ^ (1 << u) ^ (1 << v)];
            dp[mask1][mask2] += dp[mask1 ^ (1 << u)][mask2 ^ (1 << u)];
          }
        }
      }
    }
  }
  for (int mask = 0; mask < (1 << n); mask++) {
    if (__builtin_popcount(mask) == k) {
      ans += dp[(1 << n) - 1][mask];
    }
  }
  cout << ans << endl;
  return 0;
}
