#include <bits/stdc++.h>
using namespace std;
const int inf = 2147483647;
long long read() {
  long long 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;
}
long long dp[1 << 11][1 << 11];
int n, m, k;
int G[111][111];
long long ans;
int cnt[1 << 11];
void out(int x) {
  for (int i = 0; i < n; i++) {
    if (x & (1 << i))
      cout << 1;
    else
      cout << 0;
  }
}
long long DP(int mask, int de) {
  if (dp[mask][de] != -1) return dp[mask][de];
  if (cnt[de] < 2) return dp[mask][de] = 0;
  if (cnt[mask] == 2) {
    int fr, tt, i;
    for (i = 0; i < n; i++)
      if (mask & (1 << i)) {
        fr = i;
        break;
      }
    i++;
    for (i; i < n; i++)
      if (mask & (1 << i)) tt = i, i = n;
    return dp[mask][de] = G[fr][tt] * 1ll && mask == de;
  }
  long long nw = 0;
  for (int i = n - 1; i >= 0; i--) {
    if ((de & (1 << i)) == 0) continue;
    int nwde = de ^ (1 << i);
    int nwm = mask ^ (1 << i);
    for (int j = 0; j < n; j++) {
      if (!(mask & (1 << j)) || (de & (1 << j)) || (i == j) || (!G[i][j]))
        continue;
      nw = nw + DP(nwm, nwde) + DP(nwm, nwde ^ (1 << j));
    }
    break;
  }
  return dp[mask][de] = nw;
}
int main() {
  n = read(), m = read(), k = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    x--, y--;
    G[x][y] = G[y][x] = 1;
  }
  for (int i = 1; i < (1 << n); i++) {
    cnt[i] = cnt[i ^ (i & -i)] + 1;
  }
  memset(dp, -1, sizeof(dp));
  dp[0][0] = 1;
  for (int i = 1; i < (1 << n); i++) {
    if (cnt[i] != k) continue;
    ans += DP((1 << n) - 1, i);
  }
  printf("%lld\n", ans);
  return 0;
}
