#include <bits/stdc++.h>
using namespace std;
const long long inf = 2147383647;
const double pi = 2 * acos(0.0);
const double eps = 1e-9;
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long* X, long long* Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
using namespace std;
template <typename T>
ostream& operator<<(ostream& out, vector<T> v) {
  out << "[ ";
  for (int i = 0; i < (((int)(v).size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  out << " ]";
  return out;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p) {
  out << "( " << p.first << ", " << p.second << ")";
  return out;
}
template <typename T>
ostream& operator,(ostream& out, T x) {
  out << x << " ";
  return out;
}
int N, M;
pair<int, int> buses[100007];
int main() {
  scanf("%d %d", &N, &M);
  for (int i = 0; i < (M); i++) {
    scanf("%d %d", &buses[i].first, &buses[i].second);
    swap(buses[i].first, buses[i].second);
  }
  sort(buses, buses + M);
  for (int i = 0; i < (M); i++) {
    swap(buses[i].first, buses[i].second);
  }
  priority_queue<pair<int, int> > pq;
  if (buses[M - 1].second != N) {
    printf("0\n");
  } else {
    long long ret = 0, sum = 0, tmp;
    int i = M - 1;
    while (i >= 0) {
      if (buses[i].second == N) {
        pq.push(make_pair(buses[i].first, 1));
        sum++;
        if (buses[i].first == 0) {
          ret++;
        }
      } else {
        break;
      }
      i--;
    }
    if (sum >= 1000000007) {
      sum %= 1000000007;
    }
    if (tmp >= 1000000007) {
      tmp %= 1000000007;
    }
    for (; i >= 0; i--) {
      while (!pq.empty() && pq.top().first > buses[i].second) {
        sum -= pq.top().second;
        if (sum < 0) {
          sum += 1000000007;
        }
        pq.pop();
      }
      if (buses[i].first == 0) {
        ret += sum;
        if (ret >= 1000000007) {
          ret -= 1000000007;
        }
      }
      pq.push(make_pair(buses[i].first, sum));
      tmp = sum;
      sum += tmp;
      if (sum >= 1000000007) {
        sum -= 1000000007;
      }
      int prevStop = buses[i].second;
      i--;
      while (i >= 0) {
        if (buses[i].second == prevStop) {
          pq.push(make_pair(buses[i].first, tmp));
          sum += tmp;
          if (sum >= 1000000007) {
            sum -= 1000000007;
          }
          if (buses[i].first == 0) {
            ret += tmp;
            if (ret >= 1000000007) {
              ret -= 1000000007;
            }
          }
        } else {
          break;
        }
        i--;
      }
      i++;
    }
    ret %= 1000000007;
    if (ret < 0) {
      ret += 1000000007;
    }
    printf("%lld\n", ret);
  }
  return 0;
}
