#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

int n, m;
int hyou[9][9];
vector<vii> part(9, vii(9));

int ans = 0;

void dfs(int x) {
  int win = 0, lose = 0;
  rep (i, n) {
    if (hyou[x][i] == 1) win++;
    if (hyou[x][i] == -1) lose++;
  }
  if (x == n - 1) {
    if (win == lose) ans++;
    return;
  }
  
  int nokori = n - 1 - win - lose;
  int stand = n / 2 - win;
  if (stand < 0 || stand > nokori) return;
  if (nokori == 0) {
    dfs(x + 1);
    return;
  }

  vi y;
  rep (i, n) {
    if (i == x || hyou[x][i]) continue;
    y.push_back(i);
  }
  
  rep (i, part[nokori][stand].size()) {
    rep (j, y.size()) {
      if (part[nokori][stand][i] & (1 << j)) {
        hyou[x][y[j]] = 1;
        hyou[y[j]][x] = -1;
      }
      else {
        hyou[x][y[j]] = -1;
        hyou[y[j]][x] = 1;
      }
    }
    dfs(x + 1);
    rep (j, y.size()) {
      hyou[x][y[j]] = 0;
      hyou[y[j]][x] = 0;
    }
  }
  
}


void part_size(ll n, ll k) {
  int comb = (1LL << k) - 1;
  while (comb < 1LL << n) {
    part[n][k].push_back(comb);
    int x = comb & -comb, y = comb + x;
    comb = ((comb & ~y) / x >> 1) | y;
  }
}


int main() {
  rep1 (i, 8) {
    rep (j, i + 1) {
      if (j == 0) {
        part[i][j].push_back(0);
      }
      else {
        part_size(i, j);
      }
    }
  }
  while (true) {
    cin >> n;
    if (n == 0) break;
    rep (i, n) rep (j, n) hyou[i][j] = 0;
    ans = 0;
    cin >> m;
    rep (i, m) {
      int x, y;
      cin >> x >> y;
      x--; y--;
      hyou[x][y] = 1;
      hyou[y][x] = -1;
    }
    dfs(0);
    cout << ans << endl;
  }
}



Measured memory_bytes: 3152