#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
  int n, m, a, b;
  static char g[19][19];
  static long long dp[1 << 19][19];
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    g[a][b] = g[b][a] = 1;
    dp[(1 << a) | (1 << b)][max(a, b)] = 1;
  }
  long long ans = 0;
  for (int i = 1, maxi = 1 << n; i < maxi; i++) {
    int k = 0;
    for (int t = i; (t & 0x1) == 0; t >>= 1) k++;
    for (int j = k + 1; j < n; j++) {
      if (dp[i][j] == 0) continue;
      if (g[k][j]) ans += dp[i][j];
      for (int l = k + 1; l < n; l++)
        if (g[j][l] && (i & (1 << l)) == 0) dp[i | (1 << l)][l] += dp[i][j];
    }
  }
  cout << (ans - m) / 2 << endl;
  return 0;
}
