#include <bits/stdc++.h>
template <class t>
inline void read(t &s) {
  s = 0;
  signed f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar();
  ;
  s *= f;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0) putchar('-'), x = -x;
  static int buf[50], top = 0;
  while (x) buf[++top] = x % 10, x /= 10;
  if (!top) buf[++top] = 0;
  while (top) putchar(buf[top--] ^ '0');
}
inline void setIn(std::string s) {
  freopen(s.c_str(), "r", stdin);
  return;
}
inline void setOut(std::string s) {
  freopen(s.c_str(), "w", stdout);
  return;
}
inline void setIO(std::string s = "") {
  setIn(s + ".in");
  setOut(s + ".out");
  return;
}
template <class t>
inline bool ckmin(t &x, t y) {
  if (x > y) {
    x = y;
    return 1;
  }
  return 0;
}
template <class t>
inline bool ckmax(t &x, t y) {
  if (x < y) {
    x = y;
    return 1;
  }
  return 0;
}
inline int lowbit(int x) { return x & (-x); }
const int MaxN = 15;
std::vector<int> E[MaxN];
int g[MaxN][MaxN], n, m, K;
struct CC {
  long long f[MaxN];
  CC() {
    f[0] = 1;
    for (int i = 1; i < MaxN; ++i) f[i] = f[i - 1] * i;
  }
  inline long long operator()(int n, int m) const {
    if (n < m || m < 0) return 0;
    return f[n] / f[n - m];
  }
} C;
int vis[MaxN];
std::pair<int, int> b[MaxN], d[MaxN];
int p[MaxN], c[MaxN], e[MaxN];
__int128 pw30;
std::vector<__int128> dr;
std::vector<std::vector<int> > Bell[MaxN];
inline void work2() {
  for (int ct = 1; ct <= std::min(K, n / 2); ++ct)
    for (auto &ar : Bell[ct]) {
      for (int i = 1; i <= n / 2; ++i)
        e[d[i].first] = e[d[i].second] = ar[i - 1];
      __int128 msk = 0;
      for (int i = 1; i <= n; ++i) msk = msk * 100 + e[i];
      msk += pw30 * ct;
      dr.emplace_back(msk);
    }
}
inline void dfs2(int dep, int cnt) {
  if (dep > n / 2) {
    std::vector<int> ret;
    for (int i = 1; i <= n / 2; ++i) ret.push_back(c[i]);
    Bell[cnt].push_back(ret);
    return;
  }
  for (int i = 1; i <= cnt; ++i) c[dep] = i, dfs2(dep + 1, cnt);
  if (cnt < K) c[dep] = cnt + 1, dfs2(dep + 1, cnt + 1);
}
inline void work() {
  for (int i = 1; i <= n / 2; ++i) p[i] = i;
  int flg = 0;
  do {
    for (int msk = 0; msk < (1 << (n / 2 - 1)); ++msk) {
      for (int j = 1; j <= n / 2; ++j) d[j] = b[p[j]];
      for (int j = 0; j < n / 2 - 1; ++j)
        if (msk & (1 << j)) std::swap(d[j + 2].first, d[j + 2].second);
      int now = 1;
      for (int j = 1; now && j < n / 2; ++j)
        now &= g[d[j].first][d[j + 1].first];
      for (int j = 1; now && j < n / 2; ++j)
        now &= g[d[j].second][d[j + 1].second];
      now &= ((g[d[1].first][d[1].second]) ||
              (g[d[n / 2].first][d[n / 2].second]));
      if (now) {
        flg = 1;
        break;
      }
    }
    if (flg) break;
  } while (std::next_permutation(p + 1, p + n / 2 + 1));
  if (!flg) return;
  for (int i = 1; i <= n / 2; ++i) d[i] = b[i];
  std::sort(d + 1, d + n / 2 + 1,
            [&](std::pair<int, int> a, std::pair<int, int> b) {
              return std::min(a.first, a.second) < std::min(b.first, b.second);
            });
  work2();
}
inline void dfs(int dep) {
  if (dep > n / 2) return work();
  int s = 0;
  for (int i = 1; !s && i <= n; ++i)
    if (!vis[i]) s = i;
  vis[s] = 1;
  for (int i = s + 1; i <= n; ++i)
    if (!vis[i])
      vis[i] = 1, b[dep] = std::make_pair(s, i), dfs(dep + 1), vis[i] = 0;
  vis[s] = 0;
}
long long f[MaxN];
signed main(void) {
  pw30 = 1;
  for (int i = 0; i < 30; ++i) pw30 *= 10;
  read(n, m, K);
  dfs2(1, 0);
  int u, v;
  for (int i = 1; i <= m; ++i)
    read(u, v), E[u].push_back(v), E[v].push_back(u), g[u][v] = g[v][u] = 1;
  dfs(1);
  for (int i = 1; i <= K; ++i) f[i] = C(K, i);
  std::sort((dr).begin(), (dr).end()),
      dr.erase(std::unique((dr).begin(), (dr).end()), dr.end());
  long long ans = 0;
  for (auto i : dr) ans += f[i / pw30];
  write(ans), putchar('\n');
  42;
  return 0;
}
