#include<bits/stdc++.h>
using namespace std;

#define int long long

#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second

using vint=vector<int>;
using pint=pair<int,int>;
using vpint=vector<pint>;

template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

template<class A,class B>
ostream& operator<<(ostream& ost,const pair<A,B>&p){
    ost<<"{"<<p.first<<","<<p.second<<"}";
    return ost;
}

template<class T>
ostream& operator<<(ostream& ost,const vector<T>&v){
    ost<<"{";
    for(int i=0;i<v.size();i++){
        if(i)ost<<",";
        ost<<v[i];
    }
    ost<<"}";
    return ost;
}

inline int topbit(unsigned long long x){
    return x?63-__builtin_clzll(x):-1;
}

inline int popcount(unsigned long long x){
    return __builtin_popcountll(x);
}

inline int parity(unsigned long long x){
    return __builtin_parity(x);
}

template<uint32_t mod>
struct ModInt{
    uint32_t a;
    ModInt& s(uint32_t vv){
        a=vv<mod?vv:vv-mod;
        return *this;
    }

    ModInt(int64_t x=0){s(x%mod+mod);}

    ModInt& operator+=(const ModInt &x){return s(a+x.a);}
    ModInt& operator-=(const ModInt &x){return s(a+mod-x.a);}
    ModInt& operator*=(const ModInt &x){
        a=uint64_t(a)*x.a%mod;
        return *this;
    }
    ModInt& operator/=(const ModInt &x){
        *this*=x.inv();
        return *this;
    }

    ModInt operator+(const ModInt &x)const{return ModInt(*this)+=x;}
    ModInt operator-(const ModInt &x)const{return ModInt(*this)-=x;}
    ModInt operator*(const ModInt &x)const{return ModInt(*this)*=x;}
    ModInt operator/(const ModInt &x)const{return ModInt(*this)/=x;}
    bool operator==(const ModInt &x)const{return a==x.a;}
    bool operator!=(const ModInt &x)const{return a!=x.a;}
    bool operator<(const ModInt &x)const{return a<x.a;}

    ModInt operator-()const{return ModInt()-*this;}
    ModInt pow(int64_t n)const{
        ModInt res(1),x(*this);
        while(n){
            if(n&1)res*=x;
            x*=x;
            n>>=1;
        }
        return res;
    }

    ModInt inv()const{return pow(mod-2);}
};

template<uint32_t mod>
istream& operator>>(istream& in,ModInt<mod>& a){
    return (in>>a.a);
}
template<uint32_t mod>
ostream& operator<<(ostream& out,const ModInt<mod>& a){
    return (out<<a.a);
}
using mint=ModInt<1000000007>;

int N,K;
int pr[666];

mint inn[666][666];
mint out[666][666];
mint dp[666][666];
signed main(){
    cin>>N>>K;
    N*=2;
    memset(pr,-1,sizeof(pr));
    rep(i,K){
        int a,b;
        cin>>a>>b;
        a--;b--;
        pr[a]=b;
        pr[b]=a;
    }


    for(int l=0;l<N;l++){
        for(int r=l+2;r<=N;r+=2){
            int cnt=0;
            bool ok=true;
            for(int i=l;i<r;i++){
                if(pr[i]==-1)cnt++;
                else{
                    if(pr[i]<l||pr[i]>=r)ok=false;
                }
            }
            if(ok){
                inn[l][r]=1;
                for(int i=1;i<=cnt;i+=2)inn[l][r]*=i;
            }
        }
    }


    for(int l=0;l<N;l++){
        for(int r=l+2;r<=N;r+=2){
            int cnt=0;
            bool ok=true;
            for(int i=0;i<l;i++){
                if(pr[i]==-1)cnt++;
                else{
                    if(l<=pr[i]&&pr[i]<r)ok=false;
                }
            }
            for(int i=r;i<N;i++){
                if(pr[i]==-1)cnt++;
                else{
                    if(l<=pr[i]&&pr[i]<r)ok=false;
                }
            }
            if(ok){
                out[l][r]=1;
                for(int i=1;i<=cnt;i+=2)out[l][r]*=i;
            }
        }
    }

    for(int len=2;len<=N;len+=2){
        for(int l=0;l+len<=N;l++){
            int r=l+len;
            dp[l][r]=inn[l][r];
            for(int k=2;k<len;k+=2){
                dp[l][r]-=dp[l][l+k]*inn[l+k][r];
            }
        }
    }

    mint ans;
    for(int l=0;l<N;l++){
        for(int r=l+2;r<=N;r+=2){
            mint tmp=dp[l][r];
            tmp*=out[l][r];
            ans+=tmp;
        }
    }
    cout<<ans<<endl;
    return 0;
}

Measured memory_bytes: 5504