B'This is a simplified version of the task Toy Train. These two versions differ only in the constraints. Hacks for this version are disabled. Alice received a set of Toy Train xe2 x84 xa2 from Bob. It consists of one train and a connected railway network of n stations, enumerated from 1 through n . The train occupies one station at a time and travels around the network of stations in a circular manner. More precisely, the immediate station that the train will visit after station i is station i+1 if 1 <= q i < n or station 1 if i = n . It takes the train 1 second to travel to its next station as described. Bob gave Alice a fun task before he left: to deliver m candies that are initially at some stations to their independent destinations using the train. The candies are enumerated from 1 through m . Candy i ( 1 <= q i <= q m ), now at station a_i , should be delivered to station b_i ( a_i neq b_i ). The train has infinite capacity, and it is possible to load off any number of candies at a station. However, only at most one candy can be loaded from a station onto the train before it leaves the station. You can choose any candy at this station. The time it takes to move the candies is negligible. Now, Alice wonders how much time is needed for the train to deliver all candies. Your task is to find, for each station, the minimum time the train would need to deliver all the candies were it to start from there. The first line contains two space-separated integers n and m ( 2 <= q n <= q 100 ; 1 <= q m <= q 200 ) -- the number of stations and the number of candies, respectively. The i -th of the following m lines contains two space-separated integers a_i and b_i ( 1 <= q a_i, b_i <= q n ; a_i neq b_i ) -- the station that initially contains candy i and the destination station of the candy, respectively. In the first and o'...