#include <bits/stdc++.h> using namespace std; #define inf 0x3f3f3f3f #pragma GCC target("avx2") #pragma GCC optimization("O3") #pragma GCC optimization("unroll-loops") #define N 505 typedef long long ll; void fastscan(int &number) { // variable to indicate sign of input number bool negative = false; register int c; number = 0; // extract current character from buffer c = getchar(); if (c == '-') { // number is negative negative = true; // extract the next character from the buffer c = getchar(); } // Keep on extracting characters if they are integers // i.e ASCII Value lies from '0'(48) to '9' (57) for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48; // if scanned input has a negative sign, negate the // value of the input number if (negative) number *= -1; } int a[N][N], b[N][N], it[N], ix[N], row, col; void process() { // fastscan(row), fastscan(col); cin >> row >> col; int mn(0), ir(0), jr(0); for (int i = 1; i <= row; ++i) { for (int j = 1; j <= col; ++j) { cin >> b[i][j]; if (b[i][j] > mn) { mn = b[i][j]; ir = i - 1, jr = j - 1; } } it[i] = i; } for (int j = 1; j <= col; ++j) ix[j] = j; for (int i = 1; i <= row; ++i) { for (int j = 1; j <= col; ++j) { a[i][j] = b[(i + ir + row - 1) % row + 1][(j + jr + col - 1) % col + 1]; } } for (int j = 1; j <= col; ++j) { for (int k = j + 1; k <= col; ++k) { if (a[1][ix[j]] < a[1][ix[k]]) swap(ix[j], ix[k]); } } for (int i = 1; i <= row; ++i) { for (int j = i + 1; j <= row; ++j) { if (a[it[i]][ix[1]] < a[it[j]][ix[1]]) { swap(it[i], it[j]); } } for (int j = 1; j <= col; ++j) { cout << a[it[i]][ix[j]] << ' '; } cout << '\n'; } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); // // freopen("MATRIX.inp", "r", stdin); // freopen("MATRIX.out", "w", stdout); process(); return 0; }