#include <bits/stdc++.h>
using namespace std;
const int MAXN = 12;
int n, m, k, g[MAXN][MAXN], c[1 << MAXN];
int msk, f[1 << MAXN][1 << MAXN];
void lucky() {
  scanf("%d %d %d", &n, &m, &k);
  msk = (1 << n) - 1;
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    u--, v--, g[u][v] = g[v][u] = 1;
  }
}
int main() {
  lucky();
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      if (!g[i][j]) continue;
      f[(1 << i) | (1 << j)][(1 << i) | (1 << j)] = 1;
    }
  for (int sU = 3; sU <= msk; sU++)
    for (int sL = 0;; sL = (sL - sU) & sU) {
      for (int i = 0; i < n; i++) {
        if (!(sU & (1 << i))) continue;
        for (int j = 0; j < n; j++) {
          if ((sU & (1 << j)) || !g[i][j]) continue;
          if ((sL & ~(1 << i)) >> j) continue;
          f[sU | (1 << j)][(sL & ~(1 << i)) | (1 << j)] += f[sU][sL];
        }
      }
      if (sU == sL) break;
    }
  int ans = 0;
  for (int sL = 0; sL <= msk; sL++) {
    c[sL] = c[sL >> 1] + (sL & 1);
    if (c[sL] == k) ans += f[msk][sL];
  }
  printf("%d\n", ans);
  return 0;
}
