Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave his room for some reason. But Dima and Inna love each other so much that they decided to get criminal... Dima constructed a trap graph. He shouted: "Hey Seryozha, have a look at my cool graph!" to get his roommate interested and kicked him into the first node. A trap graph is an undirected graph consisting of n nodes and m edges. For edge number k , Dima denoted a range of integers from l k to r k ( l k ≤ r k ) . In order to get out of the trap graph, Seryozha initially (before starting his movements) should pick some integer (let's call it x ), then Seryozha must go some way from the starting node with number 1 to the final node with number n . At that, Seryozha can go along edge k only if l k ≤ x ≤ r k . Seryozha is a mathematician. He defined the loyalty of some path from the 1 -st node to the n -th one as the number of integers x , such that if he initially chooses one of them, he passes the whole path. Help Seryozha find the path of maximum loyalty and return to his room as quickly as possible! The first line of the input contains two integers n and m (2 ≤ n ≤ 10 3 , 0 ≤ m ≤ 3·10 3 ) . Then follow m lines describing the edges. Each line contains four integers a k , b k , l k and r k (1 ≤ a k , b k ≤ n , 1 ≤ l k ≤ r k ≤ 10 6 ) . The numbers mean that in the trap graph the k -th edge connects nodes a k and b k , this edge corresponds to the range of integers from l k to r k . Note that the given graph can have loops and multiple edges. In a single line of the output print an integer — the maximum loyalty among all paths from the first node to the n -th one. If such paths do not exist or the maximum loyalty equals 0, print in a single line " Nice work, Dima! " without the quotes. Explanation of the first example. Overall, we have 2 ways to get from node 1 to node 4: first you must go along the edge 1-2 with range 1-10, then along one of the two edges 2-4