#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
const int P = 1e9 + 7;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int N, M;
  cin >> N >> M;
  vector<array<int, 17>> fa(N);
  for (int j = 0; j < 17; j++) {
    for (int i = 0; i + (1 << j) <= N; i++) {
      fa[i][j] = i;
    }
  }
  auto find = [&](int u, int k) {
    while (fa[u][k] != u) {
      u = fa[u][k] = fa[fa[u][k]][k];
    }
    return u;
  };
  auto merge = [&](int u, int v, int k) {
    u = find(u, k);
    v = find(v, k);
    fa[u][k] = v;
  };
  while (M--) {
    int l1, r1, l2, r2;
    cin >> l1 >> r1 >> l2 >> r2;
    l1--, r1--, l2--, r2--;
    for (int j = 16; ~j; j--) {
      if (l1 + (1 << j) - 1 <= r1) {
        merge(l1, l2, j);
        l1 += 1 << j;
        l2 += 1 << j;
      }
    }
  }
  for (int j = 16; j; j--) {
    for (int i = 0; i + (1 << j) <= N; i++) {
      int u = find(i, j);
      merge(i, u, j - 1);
      merge(i + (1 << j - 1), u + (1 << j - 1), j - 1);
    }
  }
  int ans = 1;
  for (int i = 0; i < N; i++) {
    if (fa[i][0] == i) {
      ans = i64(ans) * (ans == 1 ? 9 : 10) % P;
    }
  }
  cout << ans << "\n";
  return 0;
}