import java.util.*;

public class Main {
    static int n;
    static int m;
    static boolean list[][];
    static ArrayList<int[]> al = new ArrayList<int[]>();
    
    public static void main(String[] args) throws Exception {
        Scanner scan = new Scanner(System.in);
        n = scan.nextInt();
        m = scan.nextInt();
        list = new boolean[n][n];
        for(int i=0; i<m; i++) {
            int left = scan.nextInt();
            int right = scan.nextInt();
            list[left][right] = true;
            list[right][left] = true;
        }
        for(int i=0; i<n; i++) {
            int connect[] = {i, -1, -1, -1};
            solve(connect, 0);
        }
        System.out.println(al.size());
    }
    
    static void solve(int con[], int index) {
        int left = con[index];
        
        if(index == 3) {
            int right = con[0];
            if(list[left][right]) {
                if((!list[con[0]][con[2]]) && (!list[con[1]][con[3]])) {
                    int copy[] = con.clone();
                    Arrays.sort(copy);
                    boolean flag = true;
                    for (int[] i : al) {
                        if (Arrays.equals(i, copy)) {
                            flag = false;
                            break;
                        }
                    }
                    if(flag) {
                        al.add(copy);
                    }
                }
            }
            return;    
        }
        
        for(int right=0; right<n; right++) {
            if(index > 0) {
                if(right == con[index-1]) continue;
            }
            if(list[left][right]) {
                con[index+1] = right;
                solve(con, index+1);
            }
        }
    }
}