#include<bits/stdc++.h>
using namespace std;
const int MAXN = 605;
const int P = 1e9 + 7;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); } 
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
int s[MAXN], home[MAXN], dp[MAXN][MAXN];
int n, m, p[MAXN], fac[MAXN];
void update(int &x, int y) {
	x += y;
	if (x >= P) x -= P;
}
int main() {
	read(n), read(m), fac[0] = 1;
	for (int i = 1; i <= n; i++)
		fac[i] = fac[i - 1] * (2ll * i - 1) % P;
	for (int i = 1; i <= m; i++) {
		int x, y; read(x), read(y);
		home[x] = home[y] = i;
	}
	int ans = 0;
	for (int i = 1; i <= n * 2; i++) {
		static bool col[MAXN]; int cnt = 0, empty = 0;
		memset(col, false, sizeof(col));
		for (int j = i; j <= n * 2; j++) {
			if (home[j]) {
				cnt -= col[home[j]];
				col[home[j]] ^= true;
				cnt += col[home[j]];
			} else empty += 1;
			if (cnt == 0 && empty % 2 == 0) {
				dp[i][j] = fac[empty / 2];
				for (int k = i, cmt = 0; k <= j - 1; k++) {
					cmt += !home[k];
					if (cmt % 2 == 0) update(dp[i][j], P - 1ll * dp[i][k] * fac[empty / 2 - cmt / 2] % P);
				}
				update(ans, 1ll * dp[i][j] * fac[n - m - empty / 2] % P);
			}
		}
	}
	cout << ans << endl;
	return 0;
}