from collections import deque
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
mod = 10**9+7

N, M = map(int, input().split())
go = [[] for _ in range(N+1)]
back = [[] for _ in range(N+1)]
for _ in range(M):
    a, b, c, d = map(int, input().split())
    go[a].append((b, c, d))
    back[b].append((a, c, d))


# 0から到達可能なノードを調べる
# 0-Nが非連結なら0
# 到達可能内でサイクルがあればINF
vis0 = [0] * (N + 1)
vis0[0] = 1
q = [0]
while q:
    s = q.pop()
    for t, _, _ in go[s]:
        if not vis0[t]:
            vis0[t] = 1
            q.append(t)

visN = [0] * (N + 1)
visN[N] = 1
q = [N]
while q:
    s = q.pop()
    for t, _, _ in back[s]:
        if not visN[t]:
            visN[t] = 1
            q.append(t)

ok = set(i for i in range(N + 1) if vis0[i] and visN[i])
if not N in ok:
    print(0)
    exit()

deg = [0] * (N+1)
for s, e in enumerate(go):
    if s in ok:
        for t, _, _ in e:
            if t in ok:
                deg[t] += 1
q = [i for i, d in enumerate(deg) if i in ok and d == 0]
topo = []
while q:
    s = q.pop()
    topo.append(s)
    for t, _, _ in go[s]:
        if t in ok:
            deg[t] -= 1
            if deg[t] == 0:
                q.append(t)

if len(topo) < len(ok):
    print("INF")
    exit()

cnt = [0] * (N + 1)
cnt[N] = 1
for s in topo[::-1]:
    for t, _, num in back[s]:
        if t in ok:
            cnt[t] += cnt[s] * num
            cnt[t] %= mod

ans = 0
for s in topo:
    for t, L, num in go[s]:
        if t in ok:
            ans += L * num * cnt[t]
            ans %= mod

print(ans)