#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
#define MOD 1000000007
#define LL long long
struct Matrix
{int row,col;LL matr[8][8];Matrix() {}Matrix(int r,int c,int num){row=r;col=c;for(int i=1; i<=r; i++)for(int j=1; j<=c; j++)matr[i][j]=num;}
};Matrix matr_multi(Matrix m1,Matrix m2)   //矩阵乘法
{Matrix m3(m1.row,m2.col,0);for(int i=1; i<=m1.row; i++)for(int j=1; j<=m2.col; j++)for(int k=1; k<=m1.col; k++)m3.matr[i][j]=(m3.matr[i][j]+m1.matr[i][k]*m2.matr[k][j])%MOD;return m3;
}void matr_givevalue(Matrix& a,Matrix b)
{a.row=b.row;a.col=b.col;for(int i=1; i<=a.row; i++)for(int j=1; j<=a.col; j++)a.matr[i][j]=b.matr[i][j];
}Matrix matr_pow(Matrix m1,int k)  //矩阵快速幂
{Matrix m2;matr_givevalue(m2,m1);k--;while(k>0){if(k&1)m2=matr_multi(m2,m1);m1=matr_multi(m1,m1);k>>=1;}return m2;
}LL PowMod(LL n,int k)  //常规快速幂
{LL res=1;while(k>0){if(k&1)res=(res*n)%MOD;n=(n*n)%MOD;k>>=1;}return res;
}void matr_output(Matrix m)
{for(int i=1; i<=m.row; i++){for(int j=1; j<=m.col; j++)cout<<m.matr[i][j]<<" ";cout<<endl;}
}
int main()
{Matrix conflict(6,6,1);Matrix m2(1,6,1);int nn,mm;scanf("%d%d",&nn,&mm);for(int i=0; i<mm; i++){int a,b;scanf("%d%d",&a,&b);int bb=b+3,aa=a+3;if(bb>6)bb%=6;if(aa>6)aa%=6;conflict.matr[a][bb]=0;   //设置conflict，这个地方要注意conflict.matr[aa][b]=0;}Matrix m1;m1=matr_pow(conflict,nn-1);m2=matr_multi(m2,m1);LL power=PowMod(4,nn);LL res=0;for(int i=1; i<=6; i++)res=(res+m2.matr[1][i])%MOD;res=(res*power)%MOD;printf("%I64d\n",res);return 0;
}