#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 20;
int n, m, a[MAX_N][MAX_N];
long long f[(1 << (MAX_N))][MAX_N];
int bitCount(long long x) {
  int res = 0;
  for (; x; x >>= 1) res += (1 & x);
  return res;
}
int main() {
  cin >> n >> m;
  memset(a, 0, sizeof a);
  while (m--) {
    int x, y;
    cin >> x >> y;
    a[x - 1][y - 1] = a[y - 1][x - 1] = 1;
  }
  memset(f, 0, sizeof f);
  for (int i = 0; i < n; ++i) {
    f[(1 << (i))][i] = 1;
  }
  for (int bm = 1; bm < (1 << (n)); ++bm) {
    for (int i = 0; i < n; ++i) {
      if (!f[bm][i]) continue;
      for (int j = ((int)log2(bm & -bm)) + 1; j < n; ++j) {
        if (((1 << (i)) & bm) && !((1 << (j)) & bm) && a[i][j]) {
          f[bm + (1 << (j))][j] += f[bm][i];
        }
      }
    }
  }
  long long ans = 0;
  for (int bm = 1; bm < (1 << (n)); ++bm) {
    if (bitCount(bm) < 3) continue;
    for (int i = 0; i < n; ++i) {
      bitset<4> Mask(bm);
      if (a[((int)log2(bm & -bm))][i] && bm & (1 << (i))) {
        ans += f[bm][i];
      }
    }
  }
  cout << ans / 2 << endl;
}
