#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


template<typename T,T MOD = 1000000007>
struct Mint{
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(int k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }
  
  Mint inv(){return pow(MOD-2);}
  
  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}
  
  Mint operator+(Mint a) const{return Mint(v)+=a;};
  Mint operator-(Mint a) const{return Mint(v)-=a;};
  Mint operator*(Mint a) const{return Mint(v)*=a;};
  Mint operator/(Mint a) const{return Mint(v)/=a;};

  Mint operator-(){return v?MOD-v:v;}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}

  static vector<Mint> fact,finv,invs;
  
  static void init(int n){
    if(n+1<=(signed)fact.size()) return;
    fact.assign(n+1,1);
    finv.assign(n+1,1);
    invs.assign(n+1,1);
    
    for(int i=1;i<=n;i++) fact[i]=fact[i-1]*Mint(i);
    finv[n]=Mint(1)/fact[n];
    for(int i=n;i>=1;i--) finv[i-1]=finv[i]*Mint(i);
    for(int i=1;i<=n;i++) invs[i]=finv[i]*fact[i-1];
  }

  static Mint comb(long long n,int k){
    Mint res(1);
    for(int i=0;i<k;i++){
      res*=Mint(n-i);
      res/=Mint(i+1);
    }
    return res;
  }
  
  static Mint C(int n,int k){
    if(n<k||k<0) return Mint(0);
    init(n);
    return fact[n]*finv[n-k]*finv[k];
  }

  static Mint P(int n,int k){
    if(n<k||k<0) return Mint(0);
    init(n);
    return fact[n]*finv[n-k];
  }
};
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::fact = vector<Mint<T, MOD> >();
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::finv = vector<Mint<T, MOD> >();
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::invs = vector<Mint<T, MOD> >();

//INSERT ABOVE HERE

using M = Mint<int>;
const int MAX = 606;
int cnt[MAX][MAX];
int mi[MAX][MAX];
int ma[MAX][MAX];
M dp[MAX][MAX];

signed main(){
  int n,k;
  cin>>n>>k;
  vector<int> a(k),b(k);
  for(int i=0;i<k;i++) cin>>a[i]>>b[i];
  
  vector<int> c(n*2,-1);
  for(int i=0;i<k;i++){
    a[i]--;b[i]--;
    if(a[i]>b[i]) swap(a[i],b[i]);
    
    c[a[i]]=b[i];
    c[b[i]]=a[i];
  }
  
  for(int i=0;i<n*2;i++){
    for(int j=i;j<n*2;j++){
      cnt[i][j]=0;
      mi[i][j]=n*2+1;
      ma[i][j]=-1;
      for(int k=i;k<=j;k++){
        if(~c[k]){
          chmin(mi[i][j],c[k]);
          chmax(ma[i][j],c[k]);
        }else{
          cnt[i][j]++;
        }
      }
    }
  }
  
  vector<M> pa(n*2+1,0);
  pa[0]=1;
  for(int i=2;i<=n*2;i++) pa[i]=pa[i-2]*M(i-1);

  M ans(0);
  for(int l=1;l<=n*2;l++){
    for(int i=0;i+l<=n*2;i++){
      int j=i+l-1;
      if(mi[i][j]<i||ma[i][j]>j) continue;
      dp[i][j]=pa[cnt[i][j]];
      for(int k=i;k<j;k++) dp[i][j]-=dp[i][k]*pa[cnt[k+1][j]];
      ans+=dp[i][j]*pa[(n-k)*2-cnt[i][j]];
    }    
  }

  cout<<ans.v<<endl;
  return 0;
}


Measured memory_bytes: 6016