#include <bits/stdc++.h>
using namespace std;
const int MAXN = 19;
int n, m, ad[MAXN], u, v;
unsigned long long dp[1 << MAXN][MAXN], ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    cin >> u >> v;
    --u, --v;
    ad[u] |= 1 << v;
    ad[v] |= 1 << u;
  }
  for (int i = 0; i < n; ++i) dp[1 << i][i] = 1;
  for (int msk = 1; msk < (1 << n); ++msk) {
    int idx = __builtin_ctz(msk);
    for (int i = idx + 1; i < n; ++i) {
      if (((1 << i) & msk) == 0) continue;
      int tmsk = ad[i] & msk;
      for (int j = 0; j < n; ++j) {
        if (i == j || ((1 << j) & tmsk) == 0) continue;
        dp[msk][i] += dp[msk ^ (1 << i)][j];
      }
    }
    if (__builtin_popcount(msk) > 2) {
      for (int i = idx + 1; i < n; ++i) {
        if (((1 << i) & ad[idx])) ans += dp[msk][i];
      }
    }
  }
  cout << ans / 2 << endl;
  return 0;
}
