#include <bits/stdc++.h>
using namespace std;
const long long I1 = 1e9;
const long long I2 = 1e18;
const int32_t M1 = 1e9 + 7;
const int32_t M2 = 998244353;
template <typename T, typename T1>
T maxn(T &a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T minn(T &a, T1 b) {
  if (b < a) a = b;
  return a;
}
long long int dp[1000005][20];
void solve() {
  long long int n, m;
  cin >> n >> m;
  bool a[n][n];
  memset(a, false, sizeof(a));
  for (long long int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    a[x][y] = true;
    a[y][x] = true;
  }
  long long int ans = 0;
  for (long long int i = 1; i < (1 << n); i++) {
    long long int cnt = __builtin_popcountll(i), first = -1;
    for (long long int j = 0; j < 20; j++) {
      if (((1 << j) & i) > 0) {
        first = j;
        break;
      }
    }
    if (cnt == 1)
      dp[i][first] = 1;
    else {
      for (int j = first + 1; j < n; j++) {
        if (((1 << j) & i) > 0) {
          if (cnt == 2 && a[first][j]) dp[i][j] = 1;
          for (int k = first + 1; k < 20; k++) {
            if (k != j && (((1 << k) & i) > 0) && a[k][j]) {
              dp[i][j] += dp[i - (1 << j)][k];
            }
          }
        }
      }
    }
    for (long long int j = first + 1; j < n; j++) {
      if ((((1 << j) & i) > 0) && a[first][j] && cnt >= 3) {
        ans += dp[i][j];
      }
    }
  }
  cout << ans / 2 << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int testcase = 1;
  while (testcase--) solve();
  return 0;
}
