#include <iostream>
#include <map>
#include <utility>
#include <vector>

using namespace std;


int get_pair_count( int n, int depth, vector< pair<int, int> > s_pair, vector<int> flags , vector<int> comb)
{
    if ( depth == n / 2 )
    {
        vector<int> found(n);
        for ( int i = 0; i < found.size(); i++ )
            found[i] = 0;


        for ( int i = 0; i < comb.size(); i++ )
        {
            found[ s_pair[comb[i]].first ] = 1;
            found[ s_pair[comb[i]].second ] = 1;
        }

        for ( int i = 0; i < found.size(); i++ )
            if ( found[i] == 0 ) return 0;

        return 1;
    }

    int pair_count = 0;

    int start = 0;
    for ( start = s_pair.size() - 1; start >= 0 && flags[start] == -1; start-- );
    start++;

    for ( int i = start; i < s_pair.size(); i++ )
    {
        if ( flags[i] == -1 )
        {
            flags[i] = 1;

            comb[depth] = i;
            pair_count += get_pair_count( n, depth + 1, s_pair, flags, comb );

            flags[i] = -1;
        }
    }

    return pair_count;
}

int main()
{
    int c;
    int n;
    int m;

    vector< pair<int, int> > s_pair;
    vector< int > flags;
    vector< int > comb;

    cin >> c;

    for (int i = 0; i < c; i++)
    {   
        cin >> n >> m;

        for (int j = 0; j < m; j++)
        {
            int s1, s2;
            cin >> s1 >> s2;
            s_pair.push_back( pair<int,int>( s1, s2 ) );
        }

        for (int j = 0; j < m; j++)
            flags.push_back( -1 );

        for (int j = 0; j < n / 2; j++)
            comb.push_back( -1 );

        int count = get_pair_count( n, 0, s_pair, flags, comb );
        cout << count;

        s_pair.clear();
        flags.clear();
        comb.clear();
    }
}