#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
vector<vector<ll>> E[202020];
vector<int> RE[202020];
int reach[202020];
class SCC {
public:
	static const int MV = 2025000;
	vector<vector<int> > SC; int NV,GR[MV];
private:
	vector<int> E[MV], RE[MV], NUM; int vis[MV];
public:
	void init(int NV) { this->NV=NV; for(int i=0;i<NV;i++) { E[i].clear(); RE[i].clear();}}
	void add_edge(int x,int y) { E[x].push_back(y); RE[y].push_back(x); }
	void dfs(int cu) { vis[cu]=1; for(int i=0;i<E[cu].size();i++) if(!vis[E[cu][i]]) dfs(E[cu][i]); NUM.push_back(cu); }
	void revdfs(int cu, int ind) { int i; vis[cu]=1; GR[cu]=ind; SC[ind].push_back(cu);
		FOR(i,RE[cu].size()) if(!vis[RE[cu][i]]) revdfs(RE[cu][i],ind);}
	void scc() {
		int c=0,i; SC.clear(); SC.resize(NV); NUM.clear();
		assert(NV);
		FOR(i,NV) vis[i]=0; FOR(i,NV) if(!vis[i]) dfs(i); FOR(i,NV) vis[i]=0;
		for(int i=NUM.size()-1;i>=0;i--) if(!vis[NUM[i]]){
			SC[c].clear(); revdfs(NUM[i],c); sort(SC[c].begin(),SC[c].end()); c++;
		}
		SC.resize(c);
	}
};
SCC scc;

ll num[202020];
ll sum[202020];
int in[202020];
const ll mo=1000000007;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	
	scc.init(N+1);
	FOR(i,M) {
		cin>>x>>y>>j>>l;
		E[x].push_back({y,j,l});
		RE[y].push_back(x);
		scc.add_edge(x,y);
	}
	queue<int> Q;
	reach[N]=1;
	Q.push(N);
	while(Q.size()) {
		x=Q.front();
		Q.pop();
		FORR(e,RE[x]) if(reach[e]==0) {
			reach[e]=1;
			Q.push(e);
		}
	}
	scc.scc();
	if(reach[0]==0) return _P("0\n");
	FOR(i,N) if(reach[i]&&scc.SC[scc.GR[i]].size()>1) {
		cout<<"INF"<<endl;
		return;
	}
	
	FOR(i,N+1) {
		FORR(e,E[i]) if(reach[i]&&reach[e[0]]) in[e[0]]++;
	}
	
	FOR(i,N+1) if(reach[i]&&in[i]==0) Q.push(i);
	num[0]=1;
	sum[0]=0;
	
	while(Q.size()) {
		x=Q.front();
		Q.pop();
		FORR(e,E[x]) if(reach[e[0]]) {
			(num[e[0]]+=num[x]*e[2])%=mo;
			(sum[e[0]]+=e[2]*(sum[x]+num[x]*e[1]%mo))%=mo;
			in[e[0]]--;
			if(in[e[0]]==0) Q.push(e[0]);
		}
	}
	
	cout<<sum[N]<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}