import java.util.Scanner;

public class Main {
    static boolean[] taken = new boolean[10];
    static boolean[][] areFriends;
    static int studentn = 0;

    private static int operate() {
        Scanner scan = new Scanner(System.in);
        studentn = scan.nextInt();
        int pairs = scan.nextInt();

        areFriends = new boolean[10][10];

        for(int i = 0; i < pairs; i++) {
            int friend1 = scan.nextInt();
            int friend2 = scan.nextInt();

            areFriends[friend1][friend2] = true;
            areFriends[friend2][friend1] = true;
        }

        return countPairings(taken);
    }

    private static int countPairings(boolean[] t) {
        int firstFree = -1;
        int ret = 0;

        for(int i = 0; i < studentn; i++) {
            if(!t[i]) {
                firstFree = i;
                break;
            }
        }

        if(firstFree == -1) 
            return 1;

        for(int pairWith = firstFree+1; pairWith < studentn; pairWith++) {
            if(!t[pairWith] && areFriends[firstFree][pairWith]) {
                t[firstFree] = t[pairWith] = true;
                ret += countPairings(t);
                t[firstFree] = t[pairWith] = false;
            }
        }
        return ret;
    }

    public static void main(String[] args) {
        int testCase = 0;

        Scanner scan = new Scanner(System.in);
        testCase = scan.nextInt();
        int[] total = new int[testCase];

        for(int i = 0; i < testCase; i++) {
            total[i] = operate();
        }
        for(int i = 0; i < testCase; i++) {
            System.out.println(total[i]);
        }

    }
}