#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int first(int n) {
  int i = -1;
  while (n > 0) {
    i++;
    n = n >> 1;
  }
  return i;
}
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> graph[n];
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    graph[x - 1].emplace_back(y - 1);
    graph[y - 1].emplace_back(x - 1);
  }
  vector<vector<long long>> dp(pow(2, n), vector<long long>(n, 0));
  for (int i = 0; i < n; i++) {
    dp[1 << i][i] = 1;
  }
  long long ans = 0;
  for (unsigned int i = 1; i < pow(2, n); i++) {
    int b = first(i);
    for (unsigned int j = 0; j < n; j++) {
      if (((i >> j) & 1) == 0 || j == b) continue;
      for (int x : graph[j]) {
        if (((i >> x) & 1) == 0) continue;
        dp[i][j] += dp[i ^ (1 << j)][x];
      }
      bitset<32> q(i);
      if (q.count() >= 3) {
        for (int x : graph[j]) {
          if (x == b) {
            ans += dp[i][j];
            break;
          }
        }
      }
    }
  }
  cout << ans / 2 << endl;
  return 0;
}
