source_code: import java.io.OutputStream;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.util.Arrays;
  import java.io.BufferedWriter;
  import java.io.Writer;
  import java.io.OutputStreamWriter;
  import java.util.InputMismatchException;
  import java.io.IOException;
  import java.util.ArrayList;
  import java.io.InputStream;
  /**
   * Built using CHelper plug-in
   * Actual solution is at the top
   *
   * @author Alex
   */
  public class Main {
      public static void main(String[] args) {
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader in = new InputReader(inputStream);
          OutputWriter out = new OutputWriter(outputStream);
          TaskD solver = new TaskD();
          solver.solve(1, in, out);
          out.close();
      }
      static class TaskD {
          int n;
          ArrayList<Integer>[] adj;
          long[] mem;
          int start;
          long cycles(int cur, int visited) {
              if (cur == start && visited > 0) {
                  return Integer.bitCount(visited) >= 3 ? 1 : 0;
              }
              int index = visited * n + cur;
              if (mem[index] != -1) return mem[index];
              long res = 0;
              int newvisited = visited | (1 << cur);
              for (int nxt : adj[cur]) {
                  if (nxt >= start && (nxt == start || ((visited >> nxt) & 1) == 0)) {
                      res += cycles(nxt, newvisited);
                  }
              }
              return mem[index] = res;
          }
          public void solve(int testNumber, InputReader in, OutputWriter out) {
              n = in.readInt();
              int m = in.readInt();
              adj = new ArrayList[n];
              mem = new long[n * (1 << n)];
              for (int i = 0; i < adj.length; i++) adj[i] = new ArrayList<>();
              for (int i = 0; i < m; i++) {
                  int a = in.readInt() - 1, b = in.readInt() - 1;
                  adj[a].add(b);
                  adj[b].add(a);
              }
              long res = 0;
              for (int start = 0; start < n; start++) {
                  Arrays.fill(mem, -1);
                  this.start = start;
                  res += cycles(start, 0) / 2;
              }
              out.printLine(res);
          }
      }
      static class OutputWriter {
          private final PrintWriter writer;
          public OutputWriter(OutputStream outputStream) {
              writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
          }
          public OutputWriter(Writer writer) {
              this.writer = new PrintWriter(writer);
          }
          public void close() {
              writer.close();
          }
          public void printLine(long i) {
              writer.println(i);
          }
      }
      static class InputReader {
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private InputReader.SpaceCharFilter filter;
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
          public int read() {
              if (numChars == -1)
                  throw new InputMismatchException();
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0)
                      return -1;
              }
              return buf[curChar++];
          }
          public int readInt() {
              int c = read();
              while (isSpaceChar(c))
                  c = read();
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9')
                      throw new InputMismatchException();
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
          public boolean isSpaceChar(int c) {
              if (filter != null)
                  return filter.isSpaceChar(c);
              return isWhitespace(c);
          }
          public static boolean isWhitespace(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
      }
  }
  
  