#pragma GCC target("avx")  // CPU 処理並列化
#pragma GCC optimize("O3")  // CPU 処理並列化
#pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-9;
const long double INF=1e+10;
const long double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	inline long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		// if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
const int mat_N=2;
const int mat_M=2;
// long long, including mod calculation
// modが中途半端にでかい (2^31付近以上) 時はunsignedにするなりなんなりしろ
struct mat{
	long long a[mat_N][mat_M];
	mat(){for(int i=0;i<mat_N;i++)for(int j=0;j<mat_M;j++)a[i][j]=0;}
	mat(int s){for(int i=0;i<mat_N;i++)for(int j=0;j<mat_M;j++)a[i][j]=(i==j)*s;}
	mat operator+(const mat &m)const{
		mat ret;
		for(int i=0;i<mat_N;i++)for(int j=0;j<mat_M;j++)ret.a[i][j]=(a[i][j]+m.a[i][j]>=mod?(a[i][j]+m.a[i][j]-mod):(a[i][j]+m.a[i][j]));
		return ret;
	}
	mat operator-(const mat &m)const{
		mat ret;
		for(int i=0;i<mat_N;i++)for(int j=0;j<mat_M;j++)ret.a[i][j]=(a[i][j]-m.a[i][j]<0?(a[i][j]-m.a[i][j]+mod):(a[i][j]-m.a[i][j]));
		return ret;
	}
	mat operator-()const{
		mat ret;
		for(int i=0;i<mat_N;i++)for(int j=0;j<mat_M;j++)ret.a[i][j]=(a[i][j]?mod-a[i][j]:0);
		return ret;
	}
	mat operator*(const long long &k)const{
		mat ret;
		for(int i=0;i<mat_N;i++)for(int j=0;j<mat_M;j++)ret.a[i][j]=a[i][j]*k%mod;
		return ret;
	}
	// assuming mat_N = mat_M
	// by changing here, you can use for graph problems (ex. a[i][j]=min(a[i][k]+a[k][j]))
	mat operator*(const mat &m)const{
		mat ret;
		for(int k=0;k<mat_N;k++)for(int i=0;i<mat_N;i++)for(int j=0;j<mat_N;j++){
			ret.a[i][j]=(ret.a[i][j]+a[i][k]*m.a[k][j])%mod;
		}
		return ret;
	}
};
mat I=mat(1);
mat pw(mat a,long long t){
	mat ret=I;
	while(t){
		if(t&1){
			ret=ret*a;
		}
		t/=2;
		a=a*a;
	}
	return ret;
}
int p[20];
int q[20];
pair<int,int>t[40];
vector<int>v[20];
long long dp[12][1<<15];
long long A[40];
long long B[40];
int Q;
void dfs(int a,int b,int c,int d,long long ks){
	if(d==Q){
		dp[a+1][b+c]+=ks;
		return;
	}
	if(ks==0)return;
	dfs(a,b,c,d+1,ks);
	if(b&(1<<d))return;
	int L=v[d][0];
	int R=v[d][1];
	if(L==1){
		if(a)ks=ks*B[0]%mod*inv[8]%mod;
		else ks=ks*A[0]%mod;
	}else if(b&(1<<t[L-1].second)){
		ks=ks*inv[8]%mod*B[L-1]%mod;
	}else if(c&(1<<t[L-1].second)){
		ks=ks*A[L-1]%mod;
	}
	if(R==Q*2){
		ks=ks*(A[R]+B[R])%mod;
	}else if(b&(1<<t[R+1].second)){
		ks=ks*inv[8]%mod*B[R]%mod;
	}else if(c&(1<<t[R+1].second)){
		ks=ks*A[R]%mod;
	}
	if(L+1==R){
		ks=ks*A[L]%mod;
	}else{
		if(b&(1<<t[L+1].second)){
			ks=ks*inv[8]%mod*B[L]%mod;
		}else if(c&(1<<t[L+1].second)){
			ks=ks*A[L]%mod;
		}
		if(b&(1<<t[R-1].second)){
			ks=ks*inv[8]%mod*B[R-1]%mod;
		}else if(c&(1<<t[R-1].second)){
			ks=ks*A[R-1]%mod;
		}
	}
	dfs(a,b,c+(1<<d),d+1,ks);
}
int main(){
	int a,b;

	init_C(20);
	scanf("%d%d",&a,&b);
	Q=b;
	for(int i=0;i<b;i++){
		scanf("%d%d",p+i,q+i);
		p[i]--;
		t[i*2]=make_pair(p[i],i);
		t[i*2+1]=make_pair(q[i],i);
	}
	t[b*2]=make_pair(0,-1);
	t[b*2+1]=make_pair(a,1000);
	std::sort(t,t+b*2+2);
	for(int i=0;i<b*2+2;i++){
		if(t[i].second==-1||t[i].second==1000)continue;
		v[t[i].second].push_back(i);
	}
	mat m;
	m.a[0][0]=2;
	m.a[0][1]=1;
	m.a[1][0]=8;
	m.a[1][1]=9;
	
	for(int i=0;i<b*2+1;i++){
		int d=t[i+1].first-t[i].first;
		mat f=pw(m,d);
		A[i]=f.a[0][0];
		B[i]=f.a[1][0];
		// printf("%lld %lld\n",A[i],B[i]);
	}
	dp[0][0]=1;
	for(int i=0;i<9;i++){
		for(int j=0;j<(1<<b);j++){
			if(!dp[i][j])continue;
			dp[i][j]%=mod;
			// printf("%d %d: %lld\n",i,j,dp[i][j]);
			dfs(i,j,0,0,dp[i][j]);
		}
	}
	printf("%lld\n",dp[9][(1<<b)-1]%mod);
}

Measured memory_bytes: 8192