#include <bits/stdc++.h>
using namespace std;
void setup()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const long long mod = 1e9 + 7;
int n, m;
long long f[26][500000], val[2][26];
array<int, 3> quest[500000];
vector<int> remain[2];
int main()
{
setup();
cin >> n >> m;
for (int i = 0; i < m; ++i)
{
cin >> quest[i][0] >> quest[i][1];
quest[i][0]--;
quest[i][1]--;
if (quest[i][0] > quest[i][1])
{
swap(quest[i][0], quest[i][1]);
quest[i][2] = 1;
}
}
sort(quest, quest + m);
for (int i = n - 1, j = m - 1; i >= 0; --i)
{
while (0 <= j && quest[j][0] == i)
{
while (!remain[!quest[j][2]].empty() && remain[!quest[j][2]].back() <= quest[j][1])
{
for (int k = 0; k < 26; ++k)
{
(val[!quest[j][2]][k] += mod - f[remain[!quest[j][2]].back()][k]) %= mod;
}
remain[!quest[j][2]].pop_back();
}
j--;
}
remain[0].push_back(i);
remain[1].push_back(i);
for (int k = 0; k < 26; ++k)
{
f[i][k] = 1;
for (int h = 0; h < k; ++h)
{
(f[i][k] += val[1][h]) %= mod;
}
for (int h = k + 1; h < 26; ++h)
{
(f[i][k] += val[0][h]) %= mod;
}
}
for (int k = 0; k < 26; ++k)
{
(val[0][k] += f[i][k]) %= mod;
(val[1][k] += f[i][k]) %= mod;
}
}
for (int i = 26 - 2; i >= 0; --i)
{
(f[0][i] += f[0][i + 1]) %= mod;
}
cout << f[0][0];
return 0;
}
