#include <bits/stdc++.h>
using namespace std;
int n, m, dp[1030][1030], k, re;
bool is[20][20];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m >> k;
  while (m--) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    is[x][y] = is[y][x] = true;
    dp[(1 << x) ^ (1 << y)][(1 << x) ^ (1 << y)] = 1;
  }
  for (int i = 1; i < (1 << n); ++i) {
    if (__builtin_popcount(i) == 1) {
      dp[i][i] = 1;
      continue;
    }
    if (__builtin_popcount(i) == 2) {
      continue;
    }
    for (int j = 1; j < (1 << n); ++j) {
      if (__builtin_popcount(j) == 1) continue;
      for (int u = 0; u < n; ++u)
        if (i & (1 << u) && (!(j & (1 << u)))) {
          for (int v = 0; v < n; ++v)
            if (j & (1 << v)) {
              if (is[u][v]) {
                dp[i][j] += dp[i ^ (1 << v)][j ^ (1 << v)] +
                            dp[i ^ (1 << v)][j ^ (1 << v) ^ (1 << u)];
              }
            }
        }
      dp[i][j] /= __builtin_popcount(j);
    }
  }
  for (int i = 0; i < (1 << n); ++i) {
    if (__builtin_popcount(i) == k) {
      re += dp[(1 << n) - 1][i];
    }
  }
  cout << re;
  return 0;
}
