#include <bits/stdc++.h>
using namespace std;
template <class F, class T>
T convert(F a, int p = -1) {
  stringstream ss;
  if (p >= 0) ss << fixed << setprecision(p);
  ss << a;
  T r;
  ss >> r;
  return r;
}
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T cube(T x) {
  return x * x * x;
}
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
template <class T>
int cntbit(T s) {
  return s == 0 ? 0 : cntbit(s >> 1) + (s & 1);
}
const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
  if (rsz <= 0) {
    ptr = 0;
    rsz = (int)fread(bf, 1, bfsz, stdin);
    if (rsz <= 0) return EOF;
  }
  --rsz;
  return bf[ptr++];
}
void ga(char &c) {
  c = EOF;
  while (!isalpha(c)) c = gc();
}
int gs(char s[]) {
  int l = 0;
  char c = gc();
  while (isspace(c)) c = gc();
  while (c != EOF && !isspace(c)) {
    s[l++] = c;
    c = gc();
  }
  s[l] = '\0';
  return l;
}
template <class T>
bool gi(T &v) {
  v = 0;
  char c = gc();
  while (c != EOF && c != '-' && !isdigit(c)) c = gc();
  if (c == EOF) return false;
  bool neg = c == '-';
  if (neg) c = gc();
  while (isdigit(c)) {
    v = v * 10 + c - '0';
    c = gc();
  }
  if (neg) v = -v;
  return true;
}
const double PI = acos(-1.0);
const double eps = 1e-12;
const int dr[] = {0, +1, 0, -1};
const int dc[] = {+1, 0, -1, 0};
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e16 + 5;
const long long mod = (long long)1e9 + 7;
struct Toa {
  int x, y;
  Toa(){};
  Toa(int _x, int _y) {
    x = _x;
    y = _y;
  }
  bool operator<(const Toa &T) const { return y < T.y; }
};
int n, m, from[400005], to[400005];
long long f[400005], F[400005];
vector<Toa> A;
vector<int> V;
void update(int u, long long gt) {
  for (int i = u; i > 0; i -= i & -i) {
    F[i] += gt;
    if (F[i] < 0) F[i] += mod;
  }
}
long long get(int u) {
  long long res = 0;
  for (int i = u; i < 400005; i += i & -i) {
    res = (res + F[i]) % mod;
  }
  return res;
}
int main() {
  cin >> n >> m;
  V.push_back(n);
  V.push_back(0);
  for (int i = (1); i <= (m); ++i) {
    scanf("%d %d", &from[i], &to[i]);
    V.push_back(from[i]);
    V.push_back(to[i]);
  }
  sort((V).begin(), (V).end());
  for (int i = (1); i <= (m); ++i) {
    from[i] = lower_bound((V).begin(), (V).end(), from[i]) - V.begin() + 1;
    to[i] = lower_bound((V).begin(), (V).end(), to[i]) - V.begin() + 1;
    A.push_back(Toa(from[i], to[i]));
  }
  int fn = lower_bound((V).begin(), (V).end(), n) - V.begin() + 1;
  sort((A).begin(), (A).end());
  memset(F, 0, sizeof(F));
  f[1] = 1;
  update(1, 1);
  for (int i = 0; i < (((int)(A).size())); ++i) {
    if (i > 0 && A[i].y > A[i - 1].y) update(A[i - 1].y, f[A[i - 1].y]);
    long long u = get(A[i].x);
    f[A[i].y] = (f[A[i].y] + u) % mod;
  }
  cout << f[fn] << endl;
  return 0;
}
