#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}
template<unsigned MOD> struct ModInt {
    static const unsigned static_MOD = MOD;
    unsigned x;
    void undef() { x = (unsigned)-1; }
    bool isnan() const { return x == (unsigned)-1; }
    inline int geti() const { return (int)x; }
    ModInt() { x = 0; }
    ModInt(const ModInt &y) { x = y.x; }
    ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
    ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
    ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
    ModInt operator-() const { return (x ? MOD-x: 0); }

    ModInt inv() const {
	unsigned a = MOD, b = x; int u = 0, v = 1;
	while (b) {
	    int t = a / b;
	    a -= t * b; swap(a, b);
	    u -= t * v; swap(u, v);
	}
	if (u < 0) u += MOD;
	return ModInt(u);
    }
    ModInt pow(long long y) const {
	ModInt b = *this, r = 1;
	if (y < 0) { b = b.inv(); y = -y; }
	for (; y; y>>=1) {
	    if (y&1) r *= b;
	    b *= b;
	}
	return r;
    }
    friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
    friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
    friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
    friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
    friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
    friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
    friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};

const LL MOD = 1000000007;
typedef ModInt<MOD> Mint;

const int MAX2N = 602;
int N, K, N2;
int A[301];
int B[301];
int buddy[MAX2N];

Mint w[MAX2N][MAX2N];
Mint s[MAX2N][MAX2N];
int sums[MAX2N];
Mint fact[MAX2N];

void MAIN() {
    scanf("%d%d", &N, &K);
    memset(buddy, -1, sizeof buddy);
    REP (i, K) {
	scanf("%d%d", A+i, B+i);
	A[i]--;
	B[i]--;
	buddy[A[i]] = B[i];
	buddy[B[i]] = A[i];
    }


    N2 = N+N;
    REP (i, N2) sums[i+1] = sums[i] + (buddy[i] == -1? 1: 0);
    fact[0] = 1;
    REP (i, N) fact[2*i+2] = fact[2*i] * (2*i+1);

    for (int l=N2-1; l>=0; l--) {
	int mi = N2, ma = -1;
	int e = 0;
	for (int len=2; l+len<=N2; len+=2) {
	    REP (t, 2) {
		int x = buddy[l+len-2+t];
		if (x != -1) {
		    amin(mi, x);
		    amax(ma, x);
		} else {
		    e++;
		}
	    }
	    if (mi < l) break;
	    if (ma < l+len && (~e&1)) {
		s[l][l+len] = fact[e];
		w[l][l+len] += fact[e];
		for (int k=l+len+2; k<=N2; k+=2) {
		    w[l][k] -= w[l][l+len] * s[l+len][k];
		}
	    }
	}
    }

    Mint ans = 0;
    REP (l, N2) for (int r=l+2; r<=N2; r+=2) if (w[l][r].x) {
	int p = sums[N2] - sums[r] + sums[l];
	ans += w[l][r] * fact[p];
    }
    printf("%d\n", ans.geti());
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}



Measured memory_bytes: 3200