#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const long long BIG = 1446803456761533460LL;
const int Big = 336860180;
const int INF = INT_MAX;
const vector<vector<int> > adj4({{0, 1}, {0, -1}, {1, 0}, {-1, 0}});
const vector<vector<int> > adj8(
    {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, -1}, {-1, 1}, {1, 1}});
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
bool isprime(int n) {
  if (n == 2 || n == 3) return true;
  if (n < 2 || n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 6; (i - 1) * (i - 1) <= n; i += 6) {
    if (n % (i - 1) == 0 || n % (i + 1) == 0) {
      return false;
    }
  }
  return true;
}
vector<bool> sprime;
void genPrime(int sz) {
  sprime = vector<bool>(sz, true);
  sprime[0] = false;
  sprime[1] = false;
  for (int i = (2); i < (sz); ++i) {
    if (sprime[i]) {
      for (int j = i * i; j < sz; j += i) {
        sprime[j] = false;
      }
    }
  }
}
int powMod(int a, int b, int mod) {
  int n = 1;
  int p = a;
  while (b > 0) {
    if (b % 2 == 1) {
      n *= p;
      n %= mod;
    }
    p *= p;
    p %= mod;
    b /= 2;
  }
  return n;
}
int modularInverse(int a, int mod) { return powMod(a, mod - 2, mod); }
int binarysearch(int l, int r, bool (*bsfunction)(int)) {
  while (r - l > 1) {
    int mid = (l + r) / 2;
    bool val = bsfunction(mid);
    if (val) {
      r = mid;
    } else {
      l = mid;
    }
  }
  return l;
}
stringstream sss;
const int maxn = 10;
const int max2n = 1 << maxn;
int mat[maxn][maxn];
int dp[max2n][max2n];
void MAIN() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < (m); ++i) {
    int a, b;
    cin >> a >> b;
    --a, --b;
    mat[a][b] = mat[b][a] = 1;
  }
  int n2 = 1 << n;
  for (int i = 0; i < (n); ++i) {
    for (int j = (i + 1); j < (n); ++j) {
      if (mat[i][j]) {
        int mask = (1 << i) + (1 << j);
        dp[mask][mask] = 1;
      }
    }
  }
  for (int tmask = 0; tmask < (n2); ++tmask) {
    for (int lmask = (1); lmask < (n2); ++lmask) {
      if ((tmask | lmask) != tmask) continue;
      int leaf = lmask & (-lmask);
      int li = __builtin_ctz(leaf);
      for (int i = 0; i < (n); ++i) {
        if (mat[i][li] && (((tmask >> i) & 1) == 1) &&
            (((lmask >> i) & 1) == 0)) {
          dp[tmask][lmask] += dp[tmask ^ leaf][lmask ^ leaf] +
                              dp[tmask ^ leaf][lmask ^ leaf ^ (1 << i)];
        }
      }
    }
  }
  int r = 0;
  for (int i = 0; i < (n2); ++i) {
    if (__builtin_popcount(i) == k) {
      r += dp[n2 - 1][i];
    }
  }
  cout << (r) << '\n';
}
int TESTCASEN = 1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(10);
  sss << R"(
4 6 2
1 2
2 3
3 4
4 1
1 3
2 4
    )";
  for (int test = 0; test < (TESTCASEN); ++test) {
    MAIN();
  }
  return 0;
}
