#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long

using namespace std;

const int kmax = 2e6 + 3;
const int Mod = 1e9 + 7;
const int kmaxM = 26;

int n, m;
int p[2][kmax];
int stk[kmax][2], tp[2];
long long f[kmax][kmaxM], s[kmaxM][2];
long long sum[kmaxM][2], res;

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for(int i = 1, x, y; i <= m; i++) {
    cin >> x >> y;
    if(x < y) {
      p[0][x] = max(p[0][x], y);
    } else {
      p[1][y] = max(p[1][y], x);
    }
  }
  for(int i = n; i; i--) {
    for(; tp[0] && p[0][i] >= stk[0][tp[0]]; tp[0]--) {
      for(int j = 0; j < kmaxM; j++) {
        s[j][0] = (s[j][0] - f[stk[0][tp[0]]][j] + Mod) % Mod;
      }
    }
    for(; tp[1] && p[1][i] >= stk[1][tp[1]]; tp[1]--) {
      for(int j = 0; j < kmaxM; j++) {
        s[j][1] = (s[j][1] - f[stk[1][tp[1]]][j] + Mod) % Mod;
      }
    }
    for(int j = 0; j < kmaxM; j++) sum[j][0] = s[j][0], sum[j][1] = s[j][1];
    for(int j = 1; j < kmaxM; j++) sum[j][0] = (sum[j][0] + sum[j - 1][0]) % Mod, sum[j][1] = (sum[j][1] + sum[j - 1][1]) % Mod;
    for(int j = 0; j < kmaxM; j++) {
      f[i][j] = (sum[kmaxM - 1][0] - sum[j][0] + 1 + Mod) % Mod;
      if(j) f[i][j] = (f[i][j] + sum[j - 1][1]) % Mod;
    }
    for(int j = 0; j < kmaxM; j++) {
      s[j][0] = (s[j][0] + f[i][j]) % Mod;
      s[j][1] = (s[j][1] + f[i][j]) % Mod;
    }
    stk[0][++tp[0]] = stk[1][++tp[1]] = i;
  }
  for(int i = 0; i < kmaxM; i++) res = (res + f[1][i]) % Mod;
  cout << res;
  return 0;
}