#include <bits/stdc++.h>
using namespace std;
const int maxn = 12;
const double eps = 1e-6;
int n, m, tar;
vector<int> line[maxn];
long long f[1 << maxn];
int idx[maxn];
bool ok[maxn];
double a[maxn][maxn];
long long ans;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int count(int x) {
  int res = 0;
  while (x) {
    if (x & 1) res++;
    x >>= 1;
  }
  return res;
}
double gauss(int len) {
  double res = 1;
  for (int i = 1; i <= len; i++) {
    int now = i;
    while (now <= len && fabs(a[now][i]) <= eps) now++;
    if (now > len) continue;
    if (now != i)
      for (int j = 1; j <= len; j++) swap(a[now][j], a[i][j]);
    double tmp = a[i][i];
    res *= tmp;
    for (int j = 1; j <= len; j++) a[i][j] /= tmp;
    for (int j = 1; j <= len; j++)
      if (i != j) {
        tmp = a[j][i];
        for (int k = 1; k <= len; k++) a[j][k] -= tmp * a[i][k];
      }
  }
  for (int i = 1; i <= len; i++) res *= a[i][i];
  return round(res);
}
long long calc(int sta) {
  int cnt = count(sta), now = 0;
  if (cnt < tar) return 0;
  memset(a, 0, sizeof a);
  memset(ok, 0, sizeof ok);
  for (int i = 1; i <= n; i++)
    if (!(sta & (1 << i >> 1))) ok[i] = 1, idx[i] = ++now;
  for (int i = 1; i <= n; i++)
    if (ok[i]) {
      int sz = line[i].size();
      for (int j = 0; j < sz; j++) {
        int w = line[i][j];
        if (ok[w]) a[idx[i]][idx[w]] -= 1.0, a[idx[i]][idx[i]] += 1.0;
      }
    }
  long long res = 1;
  for (int i = 1; i <= n; i++)
    if (!ok[i]) {
      int tmp = 0, sz = line[i].size();
      for (int j = 0; j < sz; j++)
        if (ok[line[i][j]]) tmp++;
      res *= tmp;
    }
  return res * gauss(now - 1);
}
int main() {
  n = read();
  m = read();
  tar = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    line[x].push_back(y);
    line[y].push_back(x);
  }
  int mr = (1 << n) - 1;
  for (int i = 1; i <= mr; i++) f[i] = calc(i);
  for (int i = 1; i <= mr; i++) {
    if (count(i) != tar) continue;
    int sta = mr - i;
    for (int s = sta; s; s = (s - 1) & sta) {
      if (count(s) & 1)
        ans -= f[i + s];
      else
        ans += f[i + s];
    }
    ans += f[i];
  }
  cout << ans << endl;
  return 0;
}
