#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;



int GCD(int a, int b){
    if(a < b) swap(a, b);
    if(b == 0) return a;
    return GCD(b, a%b);
}

int ans;
int n;
int arr[10][10];
int win[10];
void rec(int a, int b){

    if(a == n-1 && b == n-1){
        ans++;
        return;
    }

    if(b==n){
        a++;
        b = 0;
    }

    if(a == b || arr[a][b] != -1){
        rec(a, b+1);
    }
    else{
        if(win[a] < (n-1)/2){
            arr[a][b] = 1;
            arr[b][a] = 0;
            win[a]++;
            rec(a, b+1);
            win[a]--;
            arr[a][b]=-1;
            arr[b][a]=-1;
        }

        if(win[b] < (n-1)/2){
            arr[a][b] = 0;
            arr[b][a] = 1;
            win[b]++;
            rec(a, b+1);
            win[b]--;
            arr[a][b]=-1;
            arr[b][a] = -1;
        }
    }
}
void solve(){
    int m; cin >> m;
    ans = 0;

    REP(i, 10) win[i]=0;
    REP(i, 10) REP(j, 10) arr[i][j] = -1;
    for(int i=0; i<m; ++i){
        int x, y; cin >> x >>y;
        x--; y--;
        arr[x][y] = 1;
        arr[y][x] = 0;
        win[x]++;
    }
    for(int i=0; i<n; ++i){
        if(win[i] > (n-1)/2){
            cout << 0 << endl;
            return;
        }
    }
    rec(0,0);
    cout << ans << endl;
}
int main() {
    //cout << fixed << setprecision(15);


    while(cin >> n){
        if(n == 0) break;
        solve();
    }
    return 0;
}


Measured memory_bytes: 3100