// Super Idol的笑容
// 都没你的甜
// 八月正午的阳光
// 都没你耀眼
// 热爱105°C的你
// 滴滴清纯的蒸馏水
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const int MOD=1000000007;
int fix(int i){
return (i%MOD+MOD)%MOD;
}
int n,m;
int tot[26];
int memo[500005][26];
int up[500005];
int down[500005];
set<int> gup;
set<int> gdown;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin>>n>>m;
rep(x,1,n+1) up[x]=down[x]=x;
int a,b;
rep(x,0,m){
cin>>a>>b;
if (a<b) up[a]=max(up[a],b);
else down[b]=max(down[b],a);
}
rep(x,1,n+2) gup.insert(x);
rep(x,1,n+2) gdown.insert(x);
rep(y,0,26) tot[y]=1;
rep(x,n+1,1){
while (*gup.lb(x+1)<=up[x]){
int temp=*gup.lb(x+1);
gup.erase(temp);
int curr=0;
rep(y,0,26){
tot[y]=fix(tot[y]-curr);
curr=fix(curr+memo[temp][y]);
}
}
while (*gdown.lb(x+1)<=down[x]){
int temp=*gdown.lb(x+1);
gdown.erase(temp);
int curr=0;
rep(y,26,0){
tot[y]=fix(tot[y]-curr);
curr=fix(curr+memo[temp][y]);
}
}
rep(y,0,26) memo[x][y]=tot[y];
int curr=0;
rep(y,0,26) curr=fix(curr+memo[x][y]);
rep(y,0,26) tot[y]=fix(tot[y]+curr-memo[x][y]);
}
int ans=0;
rep(y,0,26) ans=fix(ans+memo[1][y]);
cout<<ans<<endl;
}
