// #pragma GCC target("avx")
// #pragma GCC optimize(3)
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse")
// #pragma GCC optimize("-fgcse-lm")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-ftree-pre")
// #pragma GCC optimize("-ftree-vrp")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("-falign-jumps")
// #pragma GCC optimize("-falign-loops")
// #pragma GCC optimize("-falign-labels")
// #pragma GCC optimize("-fdevirtualize")
// #pragma GCC optimize("-fcaller-saves")
// #pragma GCC optimize("-fcrossjumping")
// #pragma GCC optimize("-fthread-jumps")
// #pragma GCC optimize("-funroll-loops")
// #pragma GCC optimize("-fwhole-program")
// #pragma GCC optimize("-freorder-blocks")
// #pragma GCC optimize("-fschedule-insns")
// #pragma GCC optimize("inline-functions")
// #pragma GCC optimize("-ftree-tail-merge")
// #pragma GCC optimize("-fschedule-insns2")
// #pragma GCC optimize("-fstrict-aliasing")
// #pragma GCC optimize("-fstrict-overflow")
// #pragma GCC optimize("-falign-functions")
// #pragma GCC optimize("-fcse-skip-blocks")
// #pragma GCC optimize("-fcse-follow-jumps")
// #pragma GCC optimize("-fsched-interblock")
// #pragma GCC optimize("-fpartial-inlining")
// #pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("-freorder-functions")
// #pragma GCC optimize("-findirect-inlining")
// #pragma GCC optimize("-fhoist-adjacent-loads")
// #pragma GCC optimize("-frerun-cse-after-loop")
// #pragma GCC optimize("inline-small-functions")
// #pragma GCC optimize("-finline-small-functions")
// #pragma GCC optimize("-ftree-switch-conversion")
// #pragma GCC optimize("-foptimize-sibling-calls")
// #pragma GCC optimize("-fexpensive-optimizations")
// #pragma GCC optimize("-funsafe-loop-optimizations")
// #pragma GCC optimize("inline-functions-called-once")
// #pragma GCC optimize("-fdelete-null-pointer-checks")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pb push_back
#define pf push_front
const int mod = 1e9 + 7;
const signed N = 5e5 + 5;
const ll oo = 1e18;
int n, k, pre[N];
vector<pii> kd;
short d[N];
void output() {
int p = 0, cur = 0;
for (int i = 1; i <= n; ++i) {
if (d[i] == 0) continue;
if (cur == 0) p = i;
cur += d[i];
if (cur == 0) kd.pb(make_pair(p, i - 1));
}
pre[1] = 1;
for (int i = 2; i <= n; ++i) {
int l_, r_;
for (pii pos : kd) {
l_ = i - pos.fi;
r_ = i - pos.se;
if (r_ < 1 && l_ >= 1) {
pre[i] += pre[l_] - pre[0];
if (pre[i] < 0) pre[i] += mod;
if (pre[i] >= mod) pre[i] -= mod;
}
if(l_ >= 1 && r_ >= 1) {
pre[i] += pre[l_] - pre[r_ - 1];
if (pre[i] < 0) pre[i] += mod;
if (pre[i] >= mod) pre[i] -= mod;
}
}
if (i == n) continue;
pre[i] += pre[i - 1];
if (pre[i] < 0) pre[i] += mod;
if (pre[i] >= mod) pre[i] -= mod;
}
cout << pre[n];
return;
}
void input() {
cin >> n >> k;
int l, r;
for (int i = 1; i <= k; ++i) {
cin >> l >> r;
++d[l];
--d[r + 1];
}
output();
return;
}
signed main () {
if(fopen("", "r")) {
freopen("", "r", stdin);
freopen("", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
input();
return 0;
}