/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <string>
#include <sstream>
#include <queue>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T> bool in(T a, T b, T c) { return a <= b && b < c; }
ui logceil(int x) { return x?8*sizeof(int)-__builtin_clz(x):0; }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }

template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};


#endif
 #ifndef MOD_H
#define MOD_H



template <unsigned int N> class Field {
    typedef unsigned int ui;
    typedef unsigned long long ull;
	inline ui pow(ui a, ui p){ui r=1,e=a;while(p){if(p&1){r=((ull)r*e)%N;}e=((ull)e*e)%N;p>>=1;}return r;}
	/*extended GCD(slow):ll t=0,nt=1,r=N,nr=a;while(nr){ll q=r/nr;t-=q*nt;swap(t,nt);r-=q*nr;swap(r,nr);}assert(r<=1);return(t<0)?t+N:t;*/
	inline ui inv(ui a){return pow(a,N-2);}
public:
    inline Field(int x = 0) : v(x) {}
	inline Field<N> pow(int p){return (*this)^p; }
	inline Field<N> operator^(int p){return {(int)pow(v,(ui)p)};}
    inline Field<N>&operator+=(const Field<N>&o) {if (v+o.v >= N) v += o.v - N; else v += o.v; return *this; }
    inline Field<N>&operator-=(const Field<N>&o) {if (v<o.v) v -= o.v-N; else v-=o.v; return *this; }
    inline Field<N>&operator*=(const Field<N>&o) {v=(ull)v*o.v % N; return *this; }
    inline Field<N>&operator/=(const Field<N>&o) { return *this*=inv(o.v); }
    inline Field<N> operator+(const Field<N>&o) const {Field<N>r{*this};return r+=o;}
    inline Field<N> operator-(const Field<N>&o) const {Field<N>r{*this};return r-=o;}
    inline Field<N> operator*(const Field<N>&o) const {Field<N>r{*this};return r*=o;}
    inline Field<N> operator/(const Field<N>&o) const {Field<N>r{*this};return r/=o;}
    inline Field<N> operator-() {if(v) return {(int)(N-v)}; else return {0};};
    inline Field<N>& operator++() { ++v; if (v==N) v=0; return *this; }
    inline Field<N> operator++(int) { Field<N>r{*this}; ++*this; return r; }
    inline Field<N>& operator--() { --v; if (v==-1) v=N-1; return *this; }
    inline Field<N> operator--(int) { Field<N>r{*this}; --*this; return r; }
    inline bool operator==(const Field<N>&o) const { return o.v==v; }
	inline bool operator!=(const Field<N>&o) const { return o.v!=v; }
	inline explicit operator ui() const { return v; }
	inline static vector<Field<N>>fact(int t){vector<Field<N>>F(t+1,1);for(int i=2;i<=t;++i){F[i]=F[i-1]*i;}return F;}
	inline static vector<Field<N>>invfact(int t){vector<Field<N>>F(t+1,1);Field<N> X{1};for(int i=2;i<=t;++i){X=X*i;}F[t]=1/X;for(int i=t-1;i>=2;--i){F[i]=F[i+1]*(i+1);}return F;}
private: ui v;
};
template<unsigned int N>istream &operator>>(std::istream&is,Field<N>&f){unsigned int v;is>>v;f=v;return is;}
template<unsigned int N>ostream &operator<<(std::ostream&os,const Field<N>&f){return os<<(unsigned int)f;}
template<unsigned int N>Field<N> operator+(int i,const Field<N>&f){return Field<N>(i)+f;}
template<unsigned int N>Field<N> operator-(int i,const Field<N>&f){return Field<N>(i)-f;}
template<unsigned int N>Field<N> operator*(int i,const Field<N>&f){return Field<N>(i)*f;}
template<unsigned int N>Field<N> operator/(int i,const Field<N>&f){return Field<N>(i)/f;}


typedef Field<1000000007> FieldMod;

struct Ring {
	template <typename T>
	static T div(T p, T q, T N) {
		T t=0,nt=1,r=N,nr=q;
		while(nr!=0){ T q=r/nr;t-=q*nt;r-=q*nr;swap(t,nt);swap(r,nr); }
		t=(t<0)?t+N:t;
		r=(r<0)?r+N:r;
		if (gcd(p,N)%r!=0) { return 0; }
		return (t*p/r)%N;
	}
};
#endif


class D {
public:
void solve(istream& cin, ostream& cout) {
    int N, K; cin >> N >> K;
    vector<int> C(2*N, -1);
    for (int i = 0; i < K; ++i) {
        int A,B; cin >> A >> B;
        --A; --B;
        C[A] = B;
        C[B] = A;
    }

    vector<FieldMod> Pair(N+1, 1);
    for (int i = 2; i <= N; ++i) Pair[i] = Pair[i-1] * (2*i-1);
    int R = N-K;

    vector2<FieldMod> Any(4*N, 2*N+1, 0);
    vector2<FieldMod> Single(4*N, 2*N+1, 0);
    vector2<FieldMod> Blow(4*N, 2*N+1, 0);
    for (int i = 0; i < 2*N; ++i) {
        for (int c = 2; i + c < 2*N; c += 2) {
            int j = (i + c) % (2*N);

            bool out = false;
            int unused = 0;
            for (int k = i; k < i+c; ++k) {
                if (C[k] == -1) unused++;
                else if (C[k] < i || C[k] >= j) out = true;
            }

            if (!out) {
                Any[2*N+i][c] = Any[i][c] = Pair[unused/2];
                Any[2*N+i+c][2*N-c] = Any[i+c][2*N-c] = Pair[R-unused/2];
            }
        }
    }

    for (int c = 2; c < 2*N; c += 2) {
        for (int i = 0; i < 2*N; ++i) {
            int j = (i+c-1)%(2*N);
            Single[i][c] = Any[i][c];
            for (int k = 2; k < c; k += 2) {
                Single[i][c] -= Single[i][k] * Any[i + k][c - k];
            }
            Single[2 * N + i][c] = Single[i][c];
        }
    }

    Any[0][2*N] = Pair[R];
    Single[0][2*N] = Pair[R];
    for (int i = 0; i < 2*N; ++i) {
        vector<FieldMod> cur(2*N, 0);
        cur[i] = 1;
        for (int j = i; j < 2*N; j += 2) {
            for (int k = 2; k + j < 2*N; ++k) {
                cur[j+k] += cur[j] * Single[j][k];
            }

            if (j != i) Single[0][2*N] -= cur[j] * Single[j][2*N-j+i];
//            cout << i << ' ' << j << ' ' << Single[0][2*N] << endl;
        }
//        for (int k = 2; k < 2*N; k += 2) {
//            Single[0][2*N] -= Single[0][k] * Any[k][2*N-k];
//        }
    }


//    cout << Single << Any;

    FieldMod ans = 0;
    for (int i = 0; i < 2*N; ++i) {
        vector<FieldMod> cur(4*N, 0);
        for (int c = 2; c < 2*N; c += 2) {
            cur[i+c] = Single[i][c];
        }

        for (int j = i+2; j < 2*N+i; j += 2) {
            for (int c = 2; c+j <= 2*N+i; c += 2) {
                cur[j+c] += cur[j] * Single[j][c];
            }
        }

//        cout << i << ' ' << cur[2*N+i] << endl;
        ans += cur[2*N+i];
    }

//    cout << ans << endl;
    ans += Single[0][2*N];
//    cout << ans << endl;

    for (int i = 0; i < 2*N; ++i) {
        for (int c = 2; c < 2*N; c += 2) {
            for (int k = i+1; k < i + c; ++k) {
                for (int d = 2; d + k < i + c; k += 2) {
                    Blow[i][c] += Any[k][d];
                }
            }


        }
    }
//
//    FieldMod ans = 0;
//    for (int c = 2; c < 2*N; c+=2) {
//        for (int i = 0; i < 2*N; ++i) {
//            ans += Single[i][c] * Any[i+c][2*N-c];
//            cout << i+1 << ' ' << i+c << ' ' << Single[i][c] << ' ' << Any[i+c][2*N-c] << endl;
//        }
//    }
//
//    ans /= 2;
//    ans += Pair[R];
    cout << ans << endl;
}
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	D solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 10880