#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
struct seg
{
int type,a,b;
};
const int K = 26;
int n,m;
vector<seg> segs;
ll dp[500001][K];
bool is_ok[500001];
vi get_up(int l)
{
rep2(i,0,l) is_ok[i] = 0;
rep2(i,l+1,n) is_ok[i] = 1;
forall(it,segs)
{
if(it.a <= l || it.type == 1) continue;
rep2(i,it.a,it.b) is_ok[i] = 0;
}
vi ans;
rep2(i,1,n) if(is_ok[i]) ans.pb(i);
return ans;
}
vi get_down(int l)
{
rep2(i,0,l) is_ok[i] = 0;
rep2(i,l+1,n) is_ok[i] = 1;
forall(it,segs)
{
if(it.a <= l || it.type == -1) continue;
rep2(i,it.a,it.b) is_ok[i] = 0;
}
vi ans;
rep2(i,1,n) if(is_ok[i]) ans.pb(i);
return ans;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
cin >> n >> m;
rep(i,m)
{
int a,b;
cin >> a >> b;
if(a < b)
{
segs.pb({-1,a+1,b});
}
else
{
segs.pb({1,b+1,a});
}
}
rep2(k,0,25)
{
dp[1][k] = 1;
}
ll ans = 0;
rep2(i,1,n)
{
vi up = get_up(i);
vi down = get_down(i);
rep(prv,26)
{
forall(it,up)
{
rep2(prv2,prv+1,25)
{
dp[it][prv2] += dp[i][prv];
dp[it][prv2] %= MOD;
}
}
forall(it,down)
{
rep2(prv2,0,prv-1)
{
dp[it][prv2] += dp[i][prv];
dp[it][prv2] %= MOD;
}
}
ans += dp[i][prv];
ans %= MOD;
}
}
cout << ans;
}
