#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 2e1;
long long n, m, ans, dp[1 << MAXN][MAXN];
bool edge[MAXN][MAXN];
vector<long long> adj[MAXN];
int32_t main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (long long u, v, i = 1; i <= m; i++) {
    cin >> v >> u;
    v--, u--;
    adj[v].push_back(u);
    adj[u].push_back(v);
    edge[v][u] = edge[u][v] = true;
  }
  for (long long i = 1; i < (1 << n); i++) {
    long long mx = 0, cnt = 0;
    for (long long j = 0; j < n; j++)
      if ((1 << j) & i) mx = j, cnt++;
    if (cnt == 1) {
      dp[i][mx] = 1;
      continue;
    }
    for (long long j = 0; j < n; j++)
      if ((1 << j) & i and j != mx)
        for (long long u : adj[j]) dp[i][j] += dp[i ^ (1 << j)][u];
    if (cnt < 3) continue;
    for (long long j = 0; j < n; j++)
      if (edge[j][mx]) ans += dp[i][j];
  }
  cout << (ans >> 1);
}
