#include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r) - 1; i >= (l); --i)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define sz(v) (int)v.size()
#define sum_of(v) accumulate(all(v), 0ll)
#define dbg(x) "[" #x " = " << (x) << "]"
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vl = vector<ll>;
using vd = vector<db>;
using vpi = vector<pi>;
using vpl = vector<pl>;
void setIO(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
#endif // LOCAL
}
const int MAX = 5e5 + 5;
const int mod = 1e9 + 7;
struct mint{
int v;
mint(int v = 0) : v(v) {}
friend bool operator == (const mint& a, const mint& b){ return a.v == b.v; }
friend bool operator != (const mint& a, const mint& b){ return a.v != b.v; }
mint& operator += (const mint& o){
v += o.v;
if(v >= mod) v -= mod;
return *this;
}
mint& operator -= (const mint& o){
v -= o.v;
if(v < 0) v += mod;
return *this;
}
mint& operator *= (const mint& o){
v = 1LL * v * o.v % mod;
return *this;
}
friend mint operator + (mint a, const mint& b){ return a += b; }
friend mint operator - (mint a, const mint& b){ return a -= b; }
friend mint operator * (mint a, const mint& b){ return a *= b; }
friend ostream& operator << (ostream& out, const mint& o){ return out << o.v; }
};
int N, M, R[2][MAX];
mint dp[MAX][26], pref[MAX][26], suff[MAX][26];
void process(int p){
pref[p][0] = dp[p][0];
FOR(i, 1, 26) pref[p][i] = pref[p][i-1] + dp[p][i];
suff[p][25] = dp[p][25];
ROF(i, 25, 0) suff[p][i] = suff[p][i+1] + dp[p][i];
}
mint get_sum(int p){
//assume that dp[i] have been processed
assert(suff[p][0] == pref[p][25]);
return pref[p][25];
}
int main(){
setIO();
cin >> N >> M;
FOR(i, 0, M){
int a, b;
cin >> a >> b;
if(a < b){
maximize(R[0][a], b);
} else{
maximize(R[1][b], a);
}
}
FOR(c, 0, 26) dp[N][c] = 1;
process(N);
set<int> candidates[2]; //(+), (-) [i, i+1]
candidates[0].insert(N);
candidates[1].insert(N);
mint sum = get_sum(N);
ROF(i, N, 1){
FOR(c, 0, 26) dp[i][c] += sum;
if(R[0][i]){
while(true){
auto it = candidates[1].lower_bound(i);
if(it != candidates[1].end() && *it <= R[0][i]){
//first non-zero sign in [i, R[0][i]) must be (-) => (+) must not in [i, R[0][i])
FOR(c, 1, 26){
dp[i][c] -= pref[*it][c-1];
}
candidates[1].erase(it);
} else break;
}
}
if(R[1][i]){
while(true){
auto it = candidates[0].lower_bound(i);
if(it != candidates[0].end() && *it <= R[1][i]){
//first non-zero sign in [i, R[0][i]) must be (+) => (-) must not in [i, R[0][i])
ROF(c, 25, 0){
dp[i][c] -= suff[*it][c+1];
}
candidates[0].erase(it);
} else break;
}
}
process(i);
sum = get_sum(i);
candidates[0].insert(i);
candidates[1].insert(i);
}
cout << sum << '\n';
return 0;
}
