#include <iostream>
using namespace std;

int n;
bool  areFriends[10][10];

int countPairings(bool taken[10]) {
    int firstFree = -1;
    for (int i = 0; i < n; i++) {
        if (!taken[i]) {
            firstFree = i;
            break;
        }
    }
    if (firstFree == -1) return 1;
    int ret = 0;
    for (int pairWith = firstFree + 1; pairWith < n; pairWith++) {
        if (!taken[pairWith] && areFriends[firstFree][pairWith]) {
            taken[firstFree] = taken[pairWith] = true;
            ret += countPairings(taken);
            taken[firstFree] = taken[pairWith] = false;
        }
    }
    return ret;
}

int main() {
    bool friends[10];
    int testCase;
    int m;
    cin >> testCase; if (testCase > 50 && testCase <= 0) return 0;
    for (int C = 0; C < testCase; C++) {
        cin >> n; if (n < 2 && n>10) return 0;
        cin >> m; if (m < 0 && m>(n*(n - 1)/2)) return 0;
        int pairs[2];
        for (int pair = 0; pair < m; pair++) {
            cin >> pairs[0];
            cin >> pairs[1];
            areFriends[pairs[0]][pairs[1]] = true;
            areFriends[pairs[1]][pairs[0]] = true;
        }
        countPairings(friends);
        cout << "result : " <<countPairings(friends) << endl;
        for (int i = 0; i < 10; i++) {
            friends[i] = false;
            for (int j = 0; j < 10;j++) {
                areFriends[i][j] = false;
            }
        }
    }
    return 0;
}