The course Mirko wins

Mirko and Slavko are the only two contestants in the Dabrovina Donja Grand Prix. The race runs through nearby villages, and the villages are connected by one way roads. For road $i$ we know $M_i$, the time Mirko needs to cross it, and $S_i$, the time Slavko needs.

A course starts in some village and returns to that same village. Mirko's time on a course is the sum of $M_i$ over its roads, and Slavko's time is the sum of $S_i$. Mirko wins the course when his time is smaller than Slavko's, and the difference between the two times is Mirko's advantage.

The course is not decided yet. Mirko has bribed the organisers, so they will pick a course that Mirko wins with as few roads as possible. If several courses use that number of roads, the organisers pick one where Mirko's advantage is largest.

The first line contains two integers $N$ and $M$, the number of villages and the number of roads. ($2 \le N \le 300$, $2 \le M \le N(N-1)$)

Each of the next $M$ lines contains four integers $A_i$, $B_i$, $M_i$, $S_i$ describing one road. ($1 \le A_i, B_i \le N$, $A_i \ne B_i$, $0 \le M_i, S_i \le 10^6$) The road runs one way from village $A_i$ to village $B_i$, Mirko needs $M_i$ time to cross it and Slavko needs $S_i$. No two roads connect the same pair of villages in the same direction.

At least one course that Mirko wins exists.

Print, on one line separated by a space, the number of roads on the course the organisers pick and Mirko's advantage on that course.