#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int main(){
  int N, M;
  cin >> N >> M;
  vector<vector<tuple<int, int, int>>> E1(N + 1);
  vector<vector<tuple<int, int, int>>> E2(N + 1);
  for (int i = 0; i < M; i++){
    int u, v, l, a;
    cin >> u >> v >> l >> a;
    E1[u].push_back(make_tuple(l, a, v));
    E2[v].push_back(make_tuple(l, a, u));
  }
  vector<bool> used1(N + 1, false);
  used1[0] = true;
  queue<int> Q1;
  Q1.push(0);
  while (!Q1.empty()){
    int v = Q1.front();
    Q1.pop();
    for (auto e : E1[v]){
      int w = get<2>(e);
      if (!used1[w]){
        used1[w] = true;
        Q1.push(w);
      }
    }
  }
  vector<bool> used2(N + 1, false);
  used2[N] = true;
  queue<int> Q2;
  Q2.push(N);
  while (!Q2.empty()){
    int v = Q2.front();
    Q2.pop();
    for (auto e : E2[v]){
      int w = get<2>(e);
      if (!used2[w]){
        used2[w] = true;
        Q2.push(w);
      }
    }
  }
  if (!used1[N]){
    cout << 0 << endl;
  } else {
    vector<vector<tuple<int, int, int>>> E3(N + 1);
    for (int i = 0; i <= N; i++){
      if (used1[i] && used2[i]){
        for (auto e : E1[i]){
          int w = get<2>(e);
          if (used1[w] && used2[w]){
            E3[i].push_back(e);
          }
        }
      }
    }
    vector<int> d(N + 1, 0);
    for (int i = 0; i <= N; i++){
      for (auto e : E3[i]){
        d[get<2>(e)]++;
      }
    }
    queue<int> Q;
    for (int i = 0; i <= N; i++){
      if (d[i] == 0){
        Q.push(i);
      }
    }
    vector<int> b;
    while (!Q.empty()){
      int v = Q.front();
      Q.pop();
      b.push_back(v);
      for (auto e : E3[v]){
        int w = get<2>(e);
        d[w]--;
        if (d[w] == 0){
          Q.push(w);
        }
      }
    }
    bool ok = true;
    for (int i = 0; i <= N; i++){
      if (d[i] > 0){
        ok = false;
      }
    }
    if (!ok){
      cout << "INF" << endl;
    } else {
      vector<long long> dp1(N + 1, 0);
      vector<long long> dp2(N + 1, 0);
      dp1[0] = 1;
      for (int v : b){
        for (auto e : E3[v]){
          int l = get<0>(e);
          int a = get<1>(e);
          int w = get<2>(e);
          long long t = dp1[v] * a % MOD;
          dp1[w] += dp1[v] * a;
          dp1[w] %= MOD;
          dp2[w] += (dp2[v] + dp1[v] * l % MOD) * a;
          dp2[w] %= MOD;
        }
      }
      cout << dp2[N] << endl;
    }
  }
}