#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897923846;
const long long int MOD = 1000000007;
const long long int N = 998244353;
long long int power(long long int x, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
long long int modinverse(long long int a) { return power(a, MOD - 2); }
void solve() {
  long long int n, m;
  cin >> n >> m;
  vector<pair<long long int, long long int> > vect(m);
  for (long long int i = 0; i < m; i++) {
    cin >> vect[i].second >> vect[i].first;
  }
  sort(vect.begin(), vect.end());
  vector<long long int> s(m), d(m);
  long long int ans = 0;
  for (long long int i = 0; i < m; i++) {
    long long int val = 0;
    if (vect[i].second <= 0) ++val;
    long long int l = vect[i].second, r = vect[i].first;
    long long int indl =
        lower_bound(vect.begin(), vect.end(),
                    pair<long long int, long long int>(l, -1)) -
        vect.begin();
    long long int indr =
        lower_bound(vect.begin(), vect.end(),
                    pair<long long int, long long int>(r, -1)) -
        vect.begin();
    long long int sal = indl == 0 ? 0 : s[indl - 1];
    long long int sar = indr == 0 ? 0 : s[indr - 1];
    val += sar - sal;
    val %= MOD;
    val += MOD;
    val %= MOD;
    d[i] = val % MOD;
    if (i) s[i] = s[i - 1];
    s[i] += d[i];
    s[i] %= MOD;
    if (vect[i].first == n) ans = (ans + val) % MOD;
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int test = 1;
  while (test--) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
}
