#include <bits/stdc++.h>
namespace fast_IO {
const int IN_LEN = 10000000, OUT_LEN = 10000000;
char ibuf[IN_LEN], obuf[OUT_LEN], *ih = ibuf + IN_LEN, *oh = obuf,
                                  *lastin = ibuf + IN_LEN,
                                  *lastout = obuf + OUT_LEN - 1;
inline char getchar_() {
  return (ih == lastin) &&
                 (lastin = (ih = ibuf) + fread(ibuf, 1, IN_LEN, stdin),
                  ih == lastin)
             ? EOF
             : *ih++;
}
inline void putchar_(const char x) {
  if (oh == lastout) fwrite(obuf, 1, oh - obuf, stdout), oh = obuf;
  *oh++ = x;
}
inline void flush() { fwrite(obuf, 1, oh - obuf, stdout); }
int read() {
  int x = 0;
  int zf = 1;
  char ch = ' ';
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar_();
  if (ch == '-') zf = -1, ch = getchar_();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar_();
  return x * zf;
}
void write(long long x) {
  if (x < 0) putchar_('-'), x = -x;
  if (x > 9) write(x / 10);
  putchar_(x % 10 + '0');
}
}  // namespace fast_IO
using namespace fast_IO;
struct Edge {
  int to, next;
} edges[1005];
int head[20], edge_num = 0;
inline void addEdge(int from, int to) {
  edges[++edge_num] = (Edge){to, head[from]};
  head[from] = edge_num;
}
long long f[20][1048577];
int vis[20];
long long DFS(int frt, int u, int sta, int cnt) {
  vis[u] = 1;
  if (f[u][sta]) return f[u][sta];
  for (int c_e = head[u]; c_e; c_e = edges[c_e].next) {
    int v = edges[c_e].to;
    if ((1 << (v - 1)) & sta) {
      if (cnt > 2 && v == frt) ++f[u][sta];
    } else if (v > frt)
      f[u][sta] += DFS(frt, v, sta | (1 << (v - 1)), cnt + 1);
  }
  return f[u][sta];
}
int main() {
  int n = read(), m = read();
  for (int i = 0; i < m; ++i) {
    int u = read(), v = read();
    addEdge(u, v), addEdge(v, u);
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i) ans += DFS(i, i, (1 << (i - 1)), 1);
  write(ans / 2);
  flush();
  return 0;
}
