# include <iostream> # include <algorithm> #include <map> using namespace std ; struct line { int l [1145] ; } ; line a [1145] ; bool cmp ( line a , line b ) { int cur = 0 ; while ( a . l [cur] == b . l [cur] ) { cur ++ ; } return a . l [cur] < b . l [cur] ; } int main ( ) { int n , m ; cin >> n >> m ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= m ; j ++ ) { cin >> a [i] . l [j] ; } } stable_sort ( a + 1 , a + n + 1 , cmp ) ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= m ; j ++ ) { cout << a [i] . l [j] << ' ' ; } cout << endl ; } return 0 ; }