import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;


public class Main {
    static int T;
    static int areFriends[][];
    static int taken[];
    static int Answer;

    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        T= Integer.parseInt(br.readLine());
        int N, m;
        for(int t = 0; t<T; t++){
            String input = br.readLine();
            //학생수
            N = Integer.parseInt(input.split("\\s")[0]);
            //짝수
            m = Integer.parseInt(input.split("\\s")[1]);


            areFriends= new int[10][10];
            taken= new int[N];

            String[] CoupleInput = br.readLine().split("\\s");

            //짝 정보를 받아서 coupleList라는 배열에 넣음
            Queue<Integer> coupleList = new ArrayDeque<Integer>();
            for(String num : CoupleInput){
                coupleList.add(Integer.parseInt(num));
            }

            //coupleList 큐에서 하나씩 빼서 친구여부 2차배열에 1(친구여부이면)을 삽입
            for(int i=0; i<m; i++){
                int x=coupleList.poll();
                int y = coupleList.poll();
                areFriends[x][y]=1;
                areFriends[y][x]=1;
            }


            Answer = findPair(taken);

            System.out.println(Answer);
        }
    }
    private static int findPair(int[] taken) {
        int ret=0;
        int firstFree=-1;
        for(int i=0; i<taken.length; i++){
            //아직 짝이 안지어진 사람이 있다면 firstFree를 그 사람 번호로 지정
            if(taken[i]==0){
                firstFree=i;
                break;
            }
        }

        if(firstFree==-1) return 1;

        for(int i=firstFree+1; i<taken.length; i++){
            if(taken[firstFree]==0 && taken[i]==0 && areFriends[firstFree][i]==1){
                taken[firstFree]=taken[i]=1;
                ret+=findPair(taken);
                taken[firstFree]=taken[i]=0;
            }
        }
        return ret;
    }
}