#include<cstdio>
#define mod 1000000007
#define int long long
int n,m,a[610],b[610],nxt[610],sum[610],cnt[610][610],dp[610][610],ans;
signed main(){
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=m;i++)
		scanf("%lld%lld",&a[i],&b[i]),
		nxt[a[i]]=b[i],
		nxt[b[i]]=a[i];
	n*=2;
	sum[0]=1;
	for(int i=2;i<=n;i+=2)
		sum[i]=(sum[i-2]*(i-1))%mod;
	for(int i=1;i<=n;i++)
		for(int j=i;j<=n;j++)
			cnt[i][j]=cnt[i][j-1]+(!nxt[j]);
	for(int i=1;i<=n;i++)
		for(int j=i;j<=n;j++){
			bool bo=false;
			for(int k=i;k<=j;k++)
				if(nxt[k]&&(nxt[k]>j||nxt[k]<i))
					bo=true;
			if(bo)continue;
			dp[i][j]=sum[cnt[i][j]];
			for(int k=i+1;k<=j-1;k++)
				dp[i][j]=(dp[i][j]-dp[i][k]*sum[cnt[k+1][j]]%mod+mod)%mod;
		}
	for(int i=1;i<=n;i++)
		for(int j=i;j<=n;j++)
			(ans+=dp[i][j]*sum[(n/2-m)*2-cnt[i][j]]%mod)%=mod;
	printf("%lld\n",ans);
} 