//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define shandom_ruffle random_shuffle

using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
const int nax=1207;
const ll mod=1000*1000*1000+7;
const ll modk=mod*mod*5;

int n, m;

ll sil[nax];
ll spo[nax];

pii tab[nax];

ll wyn;

int pel[nax];
int sum[nax];

int przeci(pii a, pii b)
{
	int ret=0;
	if (a.first>b.first)
		ret++;
	if (a.second>b.first)
		ret++;
	if (a.first>b.second)
		ret++;
	if (a.second>b.second)
		ret++;
	return (ret&1);
}

int licz(int a, int b)
{
	//~ int ret=0;
	//~ for (int i=a; i<=b; i++)
		//~ if (!pel[i])
			//~ ret++;
	//~ return ret;
	return sum[b]-sum[a-1];
}

int szansa[nax][nax];
ll dp[nax][nax];

void fix(ll &a)
{
	a%=mod;
	if (a<0)	
		a+=mod;
}

int main()
{
	scanf("%d%d", &n, &m);
	spo[0]=1;
	for (int i=1; i<=n; i++)
		spo[i]=((2*i-1)*spo[i-1])%mod;
	for (int i=1; i<=m; i++)
	{
		scanf("%d%d", &tab[i].first, &tab[i].second);
		pel[tab[i].first]=1;
		pel[tab[i].second]=1;
		pel[tab[i].first+2*n]=1;
		pel[tab[i].second+2*n]=1;
	}
	for (int i=1; i<=4*n; i++)
		sum[i]=sum[i-1]+(!pel[i]);
	wyn=spo[n-m];
	for (int i=1; i<=n*2; i++)
	{
		for (int j=i+2; j<=n*2; j+=2)
		{
			int czy=0;
			for (int l=1; l<=m && !czy; l++)
				if (przeci({2*i+1, 2*j+1}, {2*tab[l].first, 2*tab[l].second}))
					czy=1;
			szansa[i][j]=(!czy);
			szansa[j][i+2*n]=(!czy);
			szansa[i+2*n][j+2*n]=(!czy);
		}
	}
	for (int i=4*n; i; i--)
	{
		for (int j=i+2; j<=4*n; j+=2)
		{
			if (!szansa[i][j])
				continue;
			dp[i][j]=spo[licz(i+1, j)/2];
			for (int l=i+2; l<j; l+=2)
			{
				dp[i][j]-=dp[i][l]*spo[licz(l+1, j)/2];
				if (dp[i][j]<0)
					dp[i][j]+=modk;
			}
			fix(dp[i][j]);
			//~ debug() << i << " " << j << " " << dp[i][j] << " " << spo[licz(i+1, j)/2];
		}
	}
	for (int i=1; i<=n*2; i++)
	{
		for (int j=i+2; j<=2*n; j+=2)
		{
			if (!szansa[i][j])
				continue;
			//~ if (j<=n)
			//~ {
			wyn+=dp[i][j]*(spo[n-m-licz(i+1, j)/2]-dp[j][i+2*n]);
			fix(wyn);
			//~ }
		}
	}
	for (int i=1; i<=n*2; i++)
	{
		for (int j=i+2; j<=n*2; j+=2)
		{
			wyn+=dp[i][j]*dp[j][2*n+i];
			fix(wyn);
		}
	}
	
	printf("%lld\n", wyn);
	return 0;
}


Measured memory_bytes: 17024