After studying the beacons Mister B decided to visit alien's planet, because he learned that they live in a system of flickering star Moon. Moreover, Mister B learned that the star shines once in exactly T seconds. The problem is that the star is yet to be discovered by scientists. There are n astronomers numerated from 1 to n trying to detect the star. They try to detect the star by sending requests to record the sky for 1 second. The astronomers send requests in cycle : the i -th astronomer sends a request exactly a i second after the ( i - 1) -th (i.e. if the previous request was sent at moment t , then the next request is sent at moment t + a i ); the 1 -st astronomer sends requests a 1 seconds later than the n -th. The first astronomer sends his first request at moment 0 . Mister B doesn't know the first moment the star is going to shine, but it's obvious that all moments at which the star will shine are determined by the time of its shine moment in the interval [0, T ) . Moreover, this interval can be split into T parts of 1 second length each of form [ t , t + 1) , where t = 0, 1, 2, ..., ( T - 1) . Mister B wants to know how lucky each astronomer can be in discovering the star first. For each astronomer compute how many segments of form [ t , t + 1) ( t = 0, 1, 2, ..., ( T - 1) ) there are in the interval [0, T ) so that this astronomer is the first to discover the star if the first shine of the star happens in this time interval. The first line contains two integers T and n ( 1 ≤ T ≤ 10 9 , 2 ≤ n ≤ 2·10 5 ). The second line contains n integers a 1 , a 2 , ..., a n ( 1 ≤ a i ≤ 10 9 ). Print n integers: for each astronomer print the number of time segments describer earlier. In the first sample test the first astronomer will send requests at moments t 1 = 0, 5, 10, ... , the second — at moments t 2 = 3, 8, 13, ... . That's why interval [0, 1) the first astronomer will discover first at moment t 1 = 0 , [1, 2) — the first astronomer at moment t 1 = 5