#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << (x) << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
using ll = long long;
template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll v):v(normS(v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ll extgcd(ll a,ll b,ll &x,ll &y) const{
		ll u[]={a,1,0},v[]={b,0,1};
		while(*v){
			ll t=*u/ *v;
			rep(i,3) swap(u[i]-=t*v[i],v[i]);
		}
		if(u[0]<0) rep(i,3) u[i]=-u[i];
		x=u[1],y=u[2];
		return u[0];
	}
	ModInt inv() const{
		ll x,y;
		extgcd(v,mod,x,y);
		return make(normS(x+mod));
	}
	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;

int main(){
	int N,K;
	cin>>N>>K;
	int F = N+N-K-K;
	V<int> to(N+N,-1);
	rep(i,K){
		int x,y;
		cin>>x>>y;
		x--,y--;
		to[x] = y;
		to[y] = x;
	}
	V<mint> oF(N+N+1),ioF(N+N+1);
	auto oddFact = [](int x){
		assert(x%2==0);
		mint v = 1;
		for(int i=1;i<x;i+=2) v *= i;
		return v;
	};
	{
		for(int i=0;i<=N+N;i+=2) oF[i] = oddFact(i), ioF[i] = mint(1)/oF[i];
	}
	VV<int> f(N+N,V<int>(N+N));
	VV<bool> dead(N+N,V<bool>(N+N));

	rep(l,N+N) rep(r,N+N) if(l!=r){
		auto in = [&](int x){
			if(l<r) return l<=x && x<r;
			return l<=x || x<r;
		};
		rep(i,N+N){
			if(in(i)){
				if(to[i] == -1) f[l][r]++;
				else if(!in(to[i])) dead[l][r] = true;
			}
		}
	}

	auto prob = [&](int x,int N){
		if(x%2==1 || N%2==1) return mint(0);
		return oF[x] * oF[N-x] * ioF[N];
	};

	VV<mint> a(N+N,V<mint>(N+N));
	rep1(len,N+N-1){
		rep(l,N+N){
			int r = (l+len)%(N+N);
			if(dead[l][r]) continue;
			auto in = [&](int x){
				if(l<r) return l<=x && x<r;
				return l<=x || x<r;
			};
			a[l][r] = prob(f[l][r],F);
			for(int m=(l+1)%(N+N);in(m);m=(m+1)%(N+N)) if(!dead[l][m]){
				a[l][r] -= a[l][m] * prob(f[m][r],f[m][l]);
			}
//			printf("a[%d][%d] =%d\n",l,r,a[l][r].v);
		}
	}
	mint A = 1;
	rep(l,N+N) rep(r,N+N) if(l!=r){
		auto in = [&](int x){
			if(l<r) return l<=x && x<r;
			return l<=x || x<r;
		};
		if(!in(0)) continue;
		A -= a[l][r];
	}
//	show(A);
	mint ans = 0;
	rep(l,N+N) rep(r,N+N) if(l!=r) ans += a[l][r];
	ans += A;
	ans *= oddFact(F);
	cout<<ans<<endl;
}

Measured memory_bytes: 3200