B'A well-known art union called "Kalevich is Alive!" manufactures objects d 'art (pictures). The union consists of n painters who decided to organize their work as follows. Each painter uses only the color that was assigned to him. The colors are distinct for all painters. Let 's assume that the first painter uses color 1, the second one uses color 2, and so on. Each picture will contain all these n colors. Adding the j-th color to the i-th picture takes the j-th painter tij units of time. Order is important everywhere, so the painters ' work is ordered by the following rules: Given that the painters start working at time 0, find for each picture the time when it is ready for sale. The first line of the input contains integers m, xe2 x80 x89n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950000, xe2 x80 x891 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895), where m is the number of pictures and n is the number of painters. Then follow the descriptions of the pictures, one per line. Each line contains n integers ti1, xe2 x80 x89ti2, xe2 x80 x89..., xe2 x80 x89tin (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89tij xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000), where tij is the time the j-th painter needs to work on the i-th picture. Print the sequence of m integers r1, xe2 x80 x89r2, xe2 x80 x89..., xe2 x80 x89rm, where ri is the moment when the n-th painter stopped working on the i-th picture.'...