#include <bits/stdc++.h>
using namespace std;
using lint = long long;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;


template<unsigned P> struct ModInt {
  using M = ModInt;
  unsigned v;
  ModInt() : v(0) {}
  template<class Int> ModInt(Int x) : v(x >= 0 ? x % P : -x % P ? P - -x % P : 0) {}
  constexpr ModInt(unsigned v, int) : v(v) {}
  static constexpr unsigned p() { return P; }
  M operator+() const { return *this; }
  M operator-() const { return {v ? P - v : 0, 0}; }
  explicit operator bool() const noexcept { return v; }
  bool operator!() const noexcept { return !(bool) *this; }
  M operator*(M rhs) const { return M(*this) *= rhs; }
  M operator/(M rhs) const { return M(*this) /= rhs; }
  M operator+(M rhs) const { return M(*this) += rhs; }
  M operator-(M rhs) const { return M(*this) -= rhs; }
  bool operator==(M rhs) const { return v == rhs.v; }
  bool operator!=(M rhs) const { return !(*this == rhs); }
  M& operator*=(M rhs) { v = (unsigned long long) v * rhs.v % P; return *this; }
  M& operator/=(M rhs) { return *this *= rhs.inv(); }
  M& operator+=(M rhs) { v = rhs.v < P - v ? v + rhs.v : v - (P - rhs.v); return *this; }
  M& operator-=(M rhs) { v = rhs.v <= v ? v - rhs.v : v + (P - rhs.v); return *this; }
  M inv() const {
    int a = v, b = P, x = 1, u = 0;
    while (b) {
      int q = a / b;
      swap(a -= q * b, b);
      swap(x -= q * u, u);
    }
    assert(a == 1);
    return x;
  }
  template<class Int> M pow(Int n) const {
    n = n >= 0 ? n % (P - 1) : P - 1 - -n % (P - 1);
    M res = 1;
    for (M a = *this; n; a *= a, n >>= 1) if (n & 1) res *= a;
    return res;
  }
  template<class Int> friend M operator*(Int lhs, M rhs) { return M(lhs) *= rhs; }
  template<class Int> friend M operator/(Int lhs, M rhs) { return M(lhs) /= rhs; }
  template<class Int> friend M operator+(Int lhs, M rhs) { return M(lhs) += rhs; }
  template<class Int> friend M operator-(Int lhs, M rhs) { return M(lhs) -= rhs; }
  friend ostream& operator<<(ostream& os, M rhs) { return os << rhs.v; }
  friend istream& operator>>(istream& is, M& rhs) { lint x; is >> x; rhs = x; return is; }
  template<class Int> friend bool operator==(Int lhs, M rhs) { return M(lhs) == rhs; }
  template<class Int> friend bool operator!=(Int lhs, M rhs) { return !(lhs == rhs); }
};
using Mint = ModInt<(unsigned) 1e9 + 7>;

int main() {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  int n, k; cin >> n >> k;
  V<> a(k), b(k), c(2 * n + 1, 1);
  for (int i = 0; i < k; ++i) {
    cin >> a[i] >> b[i], --a[i], --b[i];
    if (a[i] > b[i]) swap(a[i], b[i]);
    c[a[i] + 1] = c[b[i] + 1] = 0;
  }
  c[0] = 0;
  for (int i = 0; i < 2 * n; ++i) {
    c[i + 1] += c[i];
  }
  auto chk = [&](int l, int r) -> bool {
    for (int i = 0; i < k; ++i) {
      if (a[i] < l and l <= b[i] and b[i] < r) return false;
      if (l <= a[i] and a[i] < r and r <= b[i]) return false;
    }
    return true;
  };
  V<Mint> dfact(2 * n + 1, 1);
  for (int i = 2; i <= 2 * n; ++i) {
    dfact[i] = i * dfact[i - 2];
  }

  VV<Mint> dp(2 * n, V<Mint>(2 * n + 1));
  Mint res = 0;
  for (int w = 1; w <= 2 * n; ++w) for (int l = 0; l + w <= 2 * n; ++l) {
    int r = l + w;
    if (!chk(l, r)) continue;
    int x = c[r] - c[l];
    if (x & 1) continue;
    dp[l][r] = x ? dfact[x - 1] : 1;
    for (int m = l + 1; m < r; ++m) {
      x = c[r] - c[m];
      if (x & 1) continue;
      dp[l][r] -= dp[l][m] * (x ? dfact[x - 1] : 1);
    }
    x = c[2 * n] - (c[r] - c[l]);
    res += dp[l][r] * (x ? dfact[x - 1] : 1);
  }
  cout << res << '\n';
}

Measured memory_bytes: 1664