#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) (((x) < 0)?-(x):(x))
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

using cat = long long;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N, K;
	cin >> N >> K;
	cat mod = 1000000007;
	vector<cat> F(N+2, 1);
	for(int i = 2; i <= N+1; i++) F[i] = (2*i-1) * F[i-1] % mod;
	if(K == 0) {
		N++;
		vector<cat> S = F;
		for(int i = 2; i <= N; i++) for(int j = 1; j < i; j++)
			S[i] = (S[i] - S[i-j] * F[j]) % mod;
		cat ans = (F[N]-S[N]) % mod;
		if(ans < 0) ans += mod;
		cout << ans << "\n";
		return 0;
	}
	N *= 2;
	vector<int> A(N, 0);
	for(int i = 0; i < K; i++) {
		int a, b;
		cin >> a >> b;
		A[a-1] = b;
		A[b-1] = a;
	}
	vector< vector<int> > G(N);
	for(int i = 0; i < N; i++) if(A[i]) {
		G[i].push_back(A[i]-1);
		G[A[i]-1].push_back(i);
		vector<char> inside(N, 0);
		for(int j = i; (j-A[i])%N; j = (j+1)%N) inside[j] = true;
		for(int j = 0; j < N; j++) if(inside[j] && A[j] && !inside[A[j]-1]) {
			G[j].push_back(i);
			G[i].push_back(j);
		}
	}
	vector<int> comp(N, 0);
	for(int i = 0; i < N; i++) if(A[i]) {
		comp[i] = 1;
		queue<int> q;
		q.push(i);
		while(!q.empty()) {
			for(auto v : G[q.front()]) if(!comp[v]) {
				comp[v] = 1;
				q.push(v);
			}
			q.pop();
		}
		break;
	}
	vector< vector<int> > cnt_free(N+1, vector<int>(N, 0));
	for(int i = 0; i < N; i++) for(int l = 1; l <= N; l++)
		cnt_free[l][i] = cnt_free[l-1][i] + (!A[(i+l-1)%N]);
	vector< vector<cat> > cnt(N, vector<cat>(N, 0));
	for(int l = 2; l < N; l += 2) for(int i = 0; i < N; i++) {
		bool out = false;
		for(int j = 0; j < l; j++) if(comp[(i+j)%N]) out = true;
		if(out) continue;
		vector<char> inside(N, 0);
		for(int j = 0; j < l; j++) inside[(i+j)%N] = true;
		for(int j = 0; j < l; j++) if(A[(i+j)%N] && !inside[A[(i+j)%N]-1]) out = true;
		if(out) continue;
		int r = (i+l+N-1)%N;
		int free = 0;
		for(int j = 0; j < N; j++) if(inside[j] && !A[j]) free++;
		cnt[i][r] = 1;
		for(int k = free-1; k >= 1; k -= 2) cnt[i][r] = cnt[i][r] * k % mod;
		for(int j = 2; j < l; j += 2) {
			int mid = (i+j+N-1)%N;
			cat d = cnt[i][mid];
			free = cnt_free[l-j][(i+j)%N];
			if(free&1) continue;
			d = d * F[free/2] % mod;
			cnt[i][r] = (cnt[i][r] - d) % mod;
		}
		if(cnt[i][r] < 0) cnt[i][r] += mod;
	}
	for(int l = 2; l < N; l += 2) for(int i = 0; i < N; i++) {
		int r = (i+l-1)%N; // dp[i][r]
		if(!cnt[i][r]) continue;
		int free = 0;
		for(int j = l; j < N; j++) if(!A[(i+j)%N]) free++;
		if(free&1) continue;
		for(int j = free-1; j >= 1; j -= 2) cnt[i][r] = cnt[i][r] * j % mod;
	}
	cat ans = 1;
	for(int i = N-2*K-1; i >= 1; i -= 2) ans = ans * i % mod;
	for(int i = 0; i < N; i++) if(!comp[i])
		for(int j = (i+1)%N; !comp[j]; j = (j+1)%N)
			ans = (ans + cnt[i][j]) % mod;
	cout << ans << "\n";
	return 0;
}

// look at my code
// my code is amazing


Measured memory_bytes: 5376