1 #include <cstdio>
 2 #include <iostream>
 3 #include <algorithm>
 4 #include <cstring>
 5 #define maxn 100010
 6 #define mod 1000000007
 7 #define ll long long
 8 using namespace std;
 9 int f[21][maxn],n,m,cnt;ll Ans=9;
10 int find(int x,int y){if(f[y][x]!=x)f[y][x]=find(f[y][x],y);return f[y][x];}
11 void merge(int x,int y,int len){
12   if(find(x,len)!=find(y,len))
13     f[len][f[len][x]]=f[len][y];
14 }
15 int main(){
16     //freopen("a.in","r",stdin);
17     scanf("%d%d",&n,&m);for(int j=0;j<=20;++j)for(int i=1;i<=n;++i)f[j][i]=i;
18   for(int i=1;i<=m;++i){
19     int a,b,c,d;scanf("%d%d%d%d",&a,&b,&c,&d);
20     for(int j=20;j!=-1;j--)
21       if(a+(1<<j)-1<=b)merge(a,c,j),a+=1<<j,c+=1<<j;
22   }
23   for(int j=20;j;j--)
24     for(int i=1;i+(1<<j)-1<=n;++i)
25       merge(i,find(i,j),j-1),
26     merge(i+(1<<(j-1)),f[j][i]+(1<<(j-1)),j-1);
27   for(int i=1;i<=n;++i)if(find(i,0)==i)cnt++;
28   for(int i=1;i<cnt;++i)Ans*=10,Ans%=mod;cout<<Ans;
29   return 0;
30 }